On the public citation graph
Kleine Fehlerschranken bei Matrixproblemen
0 signed · 79 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-0-387-36721-7_2openalex-snapshot
Towards Optimal Techniques for Solving Global Optimization Problems: Symmetry-Based Approach
inferred← citeshttps://doi.org/10.1007/978-1-4613-3440-8_2openalex-snapshot
A Review of Techniques in the Verified Solution of Constrained Global Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-75755-9_112openalex-snapshot
Optimizing a Parallel Self-verified Method for Solving Linear Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-92859-1_3openalex-snapshot
Improving the Performance of a Verified Linear System Solver Using Optimized Libraries and Parallel Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-01591-5_15openalex-snapshot
Fast (Parallel) Dense Linear System Solvers in C-XSC Using Error Free Transformations and BLAS
inferred← citeshttps://doi.org/10.1007/978-3-642-01591-5_16openalex-snapshot
A Note on Solving Problem 7 of the SIAM 100-Digit Challenge Using C-XSC
inferred← citeshttps://doi.org/10.1007/978-3-642-01591-5_2openalex-snapshot
Complete Interval Arithmetic and Its Implementation on the Computer
inferred← citeshttps://doi.org/10.1007/978-3-642-01591-5_4openalex-snapshot
A Modified Staggered Correction Arithmetic with Enhanced Accuracy and Very Wide Exponent Range
inferred← citeshttps://doi.org/10.1007/978-3-642-01591-5_6openalex-snapshot
Extending the Range of C-XSC: Some Tools and Applications for the Use in Parallel and Other Environments
inferred← citeshttps://doi.org/10.1007/978-3-642-55195-6_55openalex-snapshot
Finding Enclosures for Linear Systems Using Interval Matrix Multiplication in CUDA
inferred← citeshttps://doi.org/10.1007/978-3-642-72557-9_109openalex-snapshot
Zur Linearen Optimierung mit Unscharfen Daten
inferred← citeshttps://doi.org/10.1007/978-3-662-49014-3_31openalex-snapshot
A Verified Algorithm for the Centrosymmetric Solution of Sylvester Matrix Equations
inferred← citeshttps://doi.org/10.1007/978-3-7091-0525-2_1openalex-snapshot
Fast and Accurate Vector Operations
inferred← citeshttps://doi.org/10.1007/978-3-7091-6282-8_2openalex-snapshot
Advanced Arithmetic for the Digital Computer — Interval Arithmetic Revisited
inferred← citeshttps://doi.org/10.1007/978-3-7091-6918-6_15openalex-snapshot
Validated Solution of Large Linear Systems
inferred← citeshttps://doi.org/10.1007/978-3-7091-6957-5_4openalex-snapshot
A Self-Validating Method for Solving Linear Programming Problems with Interval Input Data
inferred← citeshttps://doi.org/10.1007/978-3-7091-7023-6_9openalex-snapshot
Solution of Linear and Nonlinear Algebraic Problems with Sharp, Guaranteed Bounds
inferred← citeshttps://doi.org/10.1007/978-3-7643-8773-0_16openalex-snapshot
Tight Enclosures of Solutions of Linear Systems
inferred← citeshttps://doi.org/10.1007/978-94-017-1247-7_7openalex-snapshot
INTLAB — INTerval LABoratory
inferred← citeshttps://doi.org/10.1007/978-981-10-3614-9_62openalex-snapshot
Verified Error Bounds for Symmetric Solutions of Operator Matrix Equations
inferred← citeshttps://doi.org/10.1007/bf02238302openalex-snapshot
Interval linear systems with symmetric matrices, skew-symmetric matrices and dependencies in the right hand side
inferred← citeshttps://doi.org/10.1007/bf02238359openalex-snapshot
Improved iteration schemes for validation algorithms for dense and sparse nonlinear systems
inferred← citeshttps://doi.org/10.1007/bf02241697openalex-snapshot
Solving nonlinear systems with least significant bit accuracy
inferred← citeshttps://doi.org/10.1007/bf02243016openalex-snapshot
Interval iterations for including a set of solutions
inferred← citeshttps://doi.org/10.1007/bf02253320openalex-snapshot
Centered forms and interval operators
inferred← citeshttps://doi.org/10.1007/bf02259840openalex-snapshot
An intervalal gorithm for solving systems of linear equations to prespecified accuracy
inferred← citeshttps://doi.org/10.1007/bf02320201openalex-snapshot
On the solution of interval linear systems
inferred← citeshttps://doi.org/10.1007/bf02331571openalex-snapshot
Rigorous solution of linear programming problems with uncertain data
inferred← citeshttps://doi.org/10.1007/bf02680551openalex-snapshot
On proving existence of feasible points in equality constrained optimization problems
inferred← citeshttps://doi.org/10.1007/bf03186530openalex-snapshot
Fast verified solutions of linear systems
inferred← citeshttps://doi.org/10.1007/s002110100310openalex-snapshot
Fast verification of solutions of matrix equations
inferred← citeshttps://doi.org/10.1007/s00607-010-0127-7openalex-snapshot
The exact dot product as basic tool for long interval arithmetic
inferred← citeshttps://doi.org/10.1007/s00607-010-0131-yopenalex-snapshot
Very fast and exact accumulation of products
inferred← citeshttps://doi.org/10.1007/s00607-011-0170-zopenalex-snapshot
Solvers for the verified solution of parametric linear systems
inferred← citeshttps://doi.org/10.1007/s10898-014-0158-2openalex-snapshot
Rigorous verification of feasibility
inferred← citeshttps://doi.org/10.1007/s11075-006-9032-8openalex-snapshot
On the fast solution of Toeplitz-block linear systems arising in multivariate approximation theory
inferred← citeshttps://doi.org/10.1007/s11075-011-9524-zopenalex-snapshot
Fast interval matrix multiplication
inferred← citeshttps://doi.org/10.1007/s11075-013-9735-6openalex-snapshot
Improved componentwise verified error bounds for least squares problems and underdetermined linear systems
inferred← citeshttps://doi.org/10.1007/s11075-013-9793-9openalex-snapshot
A heuristic verification of the degree of the approximate GCD of two univariate polynomials
inferred← citeshttps://doi.org/10.1007/s11075-014-9948-3openalex-snapshot
Verified error bounds for singular solutions of nonlinear systems
inferred← citeshttps://doi.org/10.1007/s11075-017-0332-yopenalex-snapshot
Verified error bounds for eigenvalues of geometric multiplicity q and corresponding invariant subspaces
inferred← citeshttps://doi.org/10.1007/s11155-006-9007-4openalex-snapshot
Towards Optimal Use of Multi-Precision Arithmetic: A Remark
inferred← citeshttps://doi.org/10.1016/0024-3795(82)90002-7openalex-snapshot
Die Auflösbarkeit linearer Kreisscheiben- und intervall-Gleichungssysteme
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90207-dopenalex-snapshot
Estimation of the Sensitivity of linear and nonlinear algebraic problems
inferred← citeshttps://doi.org/10.1016/0377-0427(94)00084-eopenalex-snapshot
Experiences with a method for enclosing solutions of systems of equations
inferred← citeshttps://doi.org/10.1016/0377-0427(94)00089-jopenalex-snapshot
Epsilon-inflation in verification algorithms
inferred← citeshttps://doi.org/10.1016/0377-0427(94)00092-fopenalex-snapshot
Verified solution of large systems and global optimization problems
inferred← citeshttps://doi.org/10.1016/b978-0-08-091636-1.50010-1openalex-snapshot
MACHINE INTERVAL ARITHMETIC
inferred← citeshttps://doi.org/10.1016/b978-0-08-091636-1.50025-3openalex-snapshot
NEWTON-LIKE METHODS FOR NONLINEAR SYSTEMS OF EQUATIONS
inferred← citeshttps://doi.org/10.1016/b978-0-12-708245-5.50006-3openalex-snapshot
What Do We Need Beyond IEEE Arithmetic ?
inferred← citeshttps://doi.org/10.1016/j.cam.2005.07.038openalex-snapshot
Super-fast validated solution of linear systems
inferred← citeshttps://doi.org/10.1016/j.cam.2012.09.024openalex-snapshot
Accurate solution of dense linear systems, Part II: Algorithms using directed rounding
inferred← citeshttps://doi.org/10.1016/j.cam.2019.112511openalex-snapshot
A Taylor model toolbox for solving ODEs implemented in MATLAB/INTLAB
inferred← citeshttps://doi.org/10.1016/j.jlap.2004.07.007openalex-snapshot
Precise numerical computation
inferred← citeshttps://doi.org/10.1016/j.laa.2010.12.002openalex-snapshot
Verified error bounds for solutions of Sylvester matrix equations
inferred← citeshttps://doi.org/10.1016/j.laa.2013.11.047openalex-snapshot
Computing enclosures for the inverse square root and the sign function of a matrix
inferred← citeshttps://doi.org/10.1016/s0024-3795(00)00279-2openalex-snapshot
Computational error bounds for multiple or nearly multiple eigenvalues
inferred← citeshttps://doi.org/10.1016/s0076-5392(08)62857-xopenalex-snapshot
Bibliography on Enclosure Methods and Related Topics
inferred← citeshttps://doi.org/10.1016/s0168-9274(02)00234-9openalex-snapshot
Highly accurate verified error bounds for Krylov type linear system solvers
inferred← citeshttps://doi.org/10.1023/a:1009967901122openalex-snapshot
Inclusion of Zeros of Nowhere Differentiable n-Dimensional Functions
inferred← citeshttps://doi.org/10.1023/a:1022374804152openalex-snapshot
Fast and Parallel Interval Arithmetic
inferred← citeshttps://doi.org/10.1023/a:1023297204431openalex-snapshot
Epsilon-inflation with contractive interval functions
inferred← citeshttps://doi.org/10.1080/01630560008816967openalex-snapshot
Verifying the existence of a zero for all elements of a function set
inferred← citeshttps://doi.org/10.1080/10556788.2018.1435649openalex-snapshot
Mathematically rigorous global optimization in floating-point arithmetic
inferred← citeshttps://doi.org/10.1109/arith.1991.145536openalex-snapshot
Fast hardware units for the computation of accurate dot products
inferred← citeshttps://doi.org/10.1137/07068816xopenalex-snapshot
Accurate Floating-Point Summation Part II: Sign, K -Fold Faithful and Rounding to Nearest
inferred← citeshttps://doi.org/10.1137/070706441openalex-snapshot
Validated Solutions of Saddle Point Linear Systems
inferred← citeshttps://doi.org/10.1137/110840248openalex-snapshot
Verified Bounds for Least Squares Problems and Underdetermined Linear Systems
inferred← citeshttps://doi.org/10.1137/s1052623402416839openalex-snapshot
Rigorous Lower and Upper Bounds in Linear Programming
inferred← citeshttps://doi.org/10.1137/s1064827594266131openalex-snapshot
Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems
inferred← citeshttps://doi.org/10.1145/3264448openalex-snapshot
Mathematics and Speed for Interval Arithmetic
inferred← citeshttps://doi.org/10.1365/s13291-016-0138-1openalex-snapshot
Gleitkommaarithmetik auf dem Prüfstand
inferred← citeshttps://doi.org/10.15480/882.305openalex-snapshot
Solving nonlinear systems with least significant bit accuracy
inferred← citeshttps://doi.org/10.1587/nolta.1.89openalex-snapshot
Verified computation of a disc containing exactly k roots of a univariate nonlinear function
inferred← citeshttps://doi.org/10.21136/am.2021.0318-19openalex-snapshot
Verified numerical computations for large-scale linear systems
inferred← citeshttps://doi.org/10.2478/s11533-011-0067-2openalex-snapshot
Interval algorithm for absolute value equations
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3155openalex-snapshot
Rigorous solution techniques for numerical constraint satisfaction problems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.