An Estimate for the Condition Number of a Matrix
From MaRDI portal
Publication:4188650
DOI10.1137/0716029zbMath0403.65012OpenAlexW1989314419MaRDI QIDQ4188650
A. K. Cline, J. H. Wilkinson, G. W. Stewart, Cleve Moler
Publication date: 1979
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0716029
Related Items
An error estimate for matrix equations, Building three-dimensional differentiable manifolds numerically, Detection of near-singularity in Cholesky and \(LDL^ T\) factorizations, The solution of the matrix equations \(AXB-CXD=E\) and \((YA-DZ,YC- BZ)=(E,F)\), On estimating the condition of eigenvalues and eigenvectors, A survey of the advances in the exploitation of the sparsity in the solution of large problems, An inexact shift‐and‐invert Arnoldi algorithm for Toeplitz matrix exponential, Estimate of the two smallest singular values of the Jacobian Matrix: Application to damped least‐squares inverse kinematics, Truncated envelope peconditioning technique, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, A modified nearly exact method for solving low-rank trust region subproblem, A stability-enhancing scaling procedure for Schur-Riccati solvers, Rules and software for detecting rank degeneracy, On thermokinematic analysis of pipe shaping in cast ingots: A numerical simulation via FDM, On the Singular “Vectors” of the Lyapunov Operator, Algebraic perturbation methods for the solution of singular linear systems, Direct Secant Updates of Matrix Factorizations, Data analysis and statistical estimation for time series: improving presentation and interpretation, Small-sample statistical condition estimation of large-scale generalized eigenvalue problems, Bounds for the condition number of a class of tridiagonal and block tridiagonal matrices, On estimating the least singular value of a matrix, A note on evaluation of coefficients in the polynomials of Padé approximants by solving systems of linear equations, Finite-element-wise domain decomposition iterative solvers with polynomial preconditioning, Methods for obtaining reliable solutions to systems of linear algebraic equations, Adaptive coded aperture design for compressive computed tomography, Numerical simulation of liquid/gas phase flow during mold filling, Methods of minimization of functions on a sphere and their applications, A new multi-domain method based on an analytical control surface for linear and second-order mean drift wave loads on floating bodies, A quasi-Gauss-Newton method for solving nonlinear algebraic equations, Statistical Condition Estimation for Linear Systems, Exploiting thread-level parallelism in the iterative solution of sparse linear systems, Upper bound of the condition number in spectral norm of tridiagonal matrices, Robust incomplete factorization for nonsymmetric matrices, On solving trust-region and other regularised subproblems in optimization, A study of Auchmuty's error estimate, The construction of projection vectors for a deflated ICCG method applied to problems with extreme contrasts in the coefficients, A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables, Computing real square roots of a real matrix, A robust ILU with pivoting based on monitoring the growth of the inverse factors, Bibliography on the evaluation of numerical software, Surface fitting to scattered data by a sum of Gaussians, Spectral solutions of PDEs on networks, An estimate for the spectral norm of the inverse of a matrix with the Gauss-Jordan algorithm, Algorithms and computational features of the LINSYST intelligent software product, Deferred correction for the ordinary differential equation eigenvalue problem, Solving the minimal least squares problem subject to bounds on the variables, Anti-Hadamard matrices, A Perturbation Result for Linear Control Problems, A direct spectral domain decomposition method for the computation of rotating flows in a T-shape geometry, Rank and null space calculations using matrix decomposition without column interchanges
Uses Software
