ROUNDING-OFF ERRORS IN MATRIX PROCESSES
From MaRDI portal
Publication:5789615
DOI10.1093/QJMAM/1.1.287zbMath0033.28501OpenAlexW2079400692WikidataQ56038115 ScholiaQ56038115MaRDI QIDQ5789615
Publication date: 1948
Published in: The Quarterly Journal of Mechanics and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7425b97e36459b55f24badde92b717369130b41e
Related Items (77)
The quantum ♮α-Rényi divergence of real order ⋮ Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems ⋮ The Legacy of Turing in Numerical Analysis ⋮ Smoothed analysis of \(\kappa(A)\) ⋮ Approximate root-free factorization techniques for solving elliptic difference equations in three space variables ⋮ Alan Turing and the Foundations of Computable Analysis ⋮ Computation of the monodromy matrix in floating point arithmetic with the Wilkinson model ⋮ Linear sequential dynamical systems, incidence algebras, and Möbius functions ⋮ On verified numerical computations in convex programming ⋮ Partial inversion for linear systems and partial closure of independence graphs ⋮ Floating-point arithmetic on the test bench. How are verified numerical solutions calculated? ⋮ How well-conditioned can the eigenvector problem be? ⋮ Triangular factors of modified matrices ⋮ Smoothed analysis of complex conic condition numbers ⋮ The condition of certain matrices. II ⋮ Finding the roots of a non-linear equation: history and reliability ⋮ Rounding Proportions:Rules of Rounding ⋮ Jointly convex mappings related to Lieb's theorem and Minkowski type operator inequalities ⋮ On the complexity of solving feasible systems of linear inequalities specified with approximate data ⋮ Some characterizations of the distribution of the condition number of a complex Gaussian matrix ⋮ Condition numbers for the cube. I: Univariate polynomials and hypersurfaces ⋮ Conditioning of linear systems arising from penalty methods ⋮ On the estimation of numerical error bounds in linear algebra based on discrete stochastic arithmetic ⋮ 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 ⋮ Computational complexity of kernel-based density-ratio estimation: a condition number analysis ⋮ Rank-profile revealing Gaussian elimination and the CUP matrix decomposition ⋮ Applicability of the method of fundamental solutions ⋮ Kantorovich type operator inequalities via the Specht ratio. ⋮ Analysis of preconditioners for conjugate gradients through distribution of eigenvalues ⋮ The rate of convergence of explicit approximate inverse preconditioning ⋮ Some remarks on the condition number of a real random square matrix ⋮ Seepage analysis in multi-domain general anisotropic media by three-dimensional boundary elements ⋮ A personal account of Turing's imprint on the development of computer science ⋮ Numerical solution of non-linear elliptic boundary-value problems by isomorphic iterative methods ⋮ On the probability distribution of singular varieties of given corank ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ Theses for Computation and Recursion on Concrete and Abstract Structures ⋮ Supertropical SLn ⋮ Some Results on Sparse Matrices ⋮ On the probability distribution of data at points in real complete intersection varieties ⋮ The upper boundary for the ratio between n-variable operator power means ⋮ A complement of the Ando--Hiai inequality ⋮ The probability that a slightly perturbed numerical analysis problem is difficult ⋮ Comparison and diagnosis of errors for six parameter estimation methods ⋮ Upper bounds on the distribution of the condition number of singular matrices ⋮ Probabilistic analyses of condition numbers ⋮ Practical aspects of interval computation ⋮ A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF ⋮ Cholesky, Toeplitz and the triangular factorization of symmetric matrices ⋮ Adversarial smoothed analysis ⋮ How ordinary elimination became Gaussian elimination ⋮ Some bayesian considerations of the choice of design for ranking, selection and estimation ⋮ Computing the homology of semialgebraic sets. I: Lax formulas ⋮ Application of the concept of the conditioning of a matrix to an identification problem ⋮ On the Round-Off Error in the Method of Successive Over-Relaxation ⋮ On local analysis ⋮ T for Turing. Machine and, also, uneasiness and desire ⋮ Solving linear algebraic equations can be interesting ⋮ Generation of errors in digital computation ⋮ Probabilistic analysis of complex Gaussian elimination without pivoting ⋮ Best possible ratios of certain matrix norms ⋮ The use of preconditioning in direct methods of solving positive definite linear systems ⋮ 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 ⋮ Motivation for working in numerical analysis ⋮ Isomorphic iterative methods in solving singularly perturbed elliptic difference equations ⋮ The asymptotic distribution of the condition number for random circulant matrices ⋮ Generalized versions of reverse Young inequalities ⋮ 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 ⋮ 33 years of numerical instability. I ⋮ Preconditioning techniques for large linear systems: A survey ⋮ Determinant for positive operators and operator geometric means ⋮ Stability versus speed in a computable algebraic model
This page was built for publication: ROUNDING-OFF ERRORS IN MATRIX PROCESSES
