Cited in
(86)- 33 years of numerical instability. I
- Approximate root-free factorization techniques for solving elliptic difference equations in three space variables
- Some bayesian considerations of the choice of design for ranking, selection and estimation
- Application of the concept of the conditioning of a matrix to an identification problem
- Kantorovich type operator inequalities via the Specht ratio.
- Real computations with fake numbers
- Linear sequential dynamical systems, incidence algebras, and Möbius functions
- Probabilistic analysis of complex Gaussian elimination without pivoting
- Preconditioning techniques for large linear systems: A survey
- Smoothed analysis of \(\kappa(A)\)
- On the complexity of solving feasible systems of linear inequalities specified with approximate data
- Computational complexity of kernel-based density-ratio estimation: a condition number analysis
- The asymptotic distribution of the condition number for random circulant matrices
- Determinant for positive operators and operator geometric means
- Some characterizations of the distribution of the condition number of a complex Gaussian matrix
- Computing the homology of semialgebraic sets. I: Lax formulas
- On local analysis
- T for Turing. Machine and, also, uneasiness and desire
- Triangular factors of modified matrices
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
- On the probability distribution of singular varieties of given corank
- Upper bounds on the distribution of the condition number of singular matrices
- Cholesky, Toeplitz and the triangular factorization of symmetric matrices
- The condition of certain matrices. II
- Jointly convex mappings related to Lieb's theorem and Minkowski type operator inequalities
- Condition numbers for the cube. I: Univariate polynomials and hypersurfaces
- The rate of convergence of explicit approximate inverse preconditioning
- The Legacy of Turing in Numerical Analysis
- Computation of the monodromy matrix in floating point arithmetic with the Wilkinson model
- Alan Turing and the foundations of computable analysis
- Comparison and diagnosis of errors for six parameter estimation methods
- Floating-point arithmetic on the test bench. How are verified numerical solutions calculated?
- On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case
- The probability that a slightly perturbed numerical analysis problem is difficult
- Numerical solution of non-linear elliptic boundary-value problems by isomorphic iterative methods
- On the estimation of numerical error bounds in linear algebra based on discrete stochastic arithmetic
- The use of preconditioning in direct methods of solving positive definite linear systems
- Rounding Proportions:Rules of Rounding
- Applicability of the method of fundamental solutions
- Finding the roots of a non-linear equation: history and reliability
- Seepage analysis in multi-domain general anisotropic media by three-dimensional boundary elements
- Theses for computation and recursion on concrete and abstract structures
- Supertropical \(\mathrm{SL}_n\)
- A personal account of Turing's imprint on the development of computer science
- Analysis of preconditioners for conjugate gradients through distribution of eigenvalues
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Generalized versions of reverse Young inequalities
- How well-conditioned can the eigenvector problem be?
- The upper boundary for the ratio between n-variable operator power means
- A theory of complexity, condition, and roundoff
- Practical aspects of interval computation
- Some Results on Sparse Matrices
- On the Round-Off Error in the Method of Successive Over-Relaxation
- Probabilistic analyses of condition numbers
- Solving linear algebraic equations can be interesting
- Generation of errors in digital computation
- Motivation for working in numerical analysis
- The quantum ♮α-Rényi divergence of real order
- Conditioning of linear systems arising from penalty methods
- Preconditioners for Krylov subspace methods: An overview
- Rounding error analysis of linear recurrences using generating series
- Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing
- Some remarks on the condition number of a real random square matrix
- Semantics, specification logic, and Hoare logic of exact real computation
- Numerical radius and geometric means of real power
- Estimations of Karcher mean by Hadamard product
- Stiff (ordinary differential) equations and robust methods: a historical approach
- On the computation of the homology of semialgebraic sets
- Solving sparse linear systems faster than matrix multiplication
- Quantifying the effectiveness of linear preconditioning in Markov chain Monte Carlo
- Rescaled ♮ α -Rényi divergences of all real orders
- Reconstruction of network dynamics from partial observations
- How ordinary elimination became Gaussian elimination
- Best possible ratios of certain matrix norms
- Matrix Hölder-McCarthy inequality via matrix geometric means
- The spectral condition number plot for regularization parameter evaluation
- Preconditioned optimization algorithms solving the problem of the non unitary joint block diagonalization: application to blind separation of convolutive mixtures
- Isomorphic iterative methods in solving singularly perturbed elliptic difference equations
- Stability versus speed in a computable algebraic model
- Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems
- On verified numerical computations in convex programming
- Partial inversion for linear systems and partial closure of independence graphs
- Smoothed analysis of complex conic condition numbers
- On the probability distribution of data at points in real complete intersection varieties
- A complement of the Ando--Hiai inequality
- Adversarial smoothed analysis
This page was built for publication: ROUNDING-OFF ERRORS IN MATRIX PROCESSES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5789615)
