ROUNDING-OFF ERRORS IN MATRIX PROCESSES

Cited in

(81)

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