scientific article; zbMATH DE number 3248502
From MaRDI portal
Publication:5535370
zbMath0154.40401MaRDI QIDQ5535370
Cleve Moler, George E. Forsythe
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Sampling Schemes for Fourier Transform Reconstruction ⋮ Increasing the stability of triangular decomposition of ill-conditioned matrices ⋮ Unnamed Item ⋮ Some comments on the solution of linear equations ⋮ On the efficiency of algorithms of analysis ⋮ Unnamed Item ⋮ Iterative Refinement Implies Numerical Stability for Gaussian Elimination ⋮ Practical use of the symmetric Lanczos process with re-orthogonalization ⋮ Optimal redundancy resolution of a kinematically redundant manipulator for a cyclic task ⋮ On a posteriori error estimation using distances between numerical solutions and angles between truncation errors ⋮ An iterative method for computing generalized inverses ⋮ A note on the instability of Gaussian elimination ⋮ Hadamard Matrices: Insights into Their Growth Factor and Determinant Computations ⋮ Round off error analysis for Gram-Schmidt method and solution of linear least squares problems ⋮ On a difference scheme for the growth-propagation equation ⋮ Estimate of the spectrum of discrete sequences in ill-posed problems based on the study of the numerical rank of the trajectory matrix ⋮ Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates ⋮ Existence of solutions of linear set-valued integral equations and their properties ⋮ Quadratic convergence in interval arithmetic, part II ⋮ Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems ⋮ The numerical solution of Fredholm integral equations using product type quadrature formulas ⋮ Cholesky decomposition of the Hilbert matrix ⋮ A new algorithm for the solution of the linear minimax approximation problem ⋮ Some Results on Sparse Matrices ⋮ Number shortening algorithms ⋮ A program complex for solving systems of linear algebraic equations ⋮ Approximation of Analytic Functions: A Method of Enhanced Convergence ⋮ Matrix augmentation and partitioning in the updating of the basis inverse ⋮ Iterative refinement for Neville elimination ⋮ Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems ⋮ A dual method for discrete Chebychev curve fitting ⋮ A New Algorithm for the Chebyshev Solution of Overdetermined Linear Systems ⋮ Representation of the algorithm for solving a system of equations with a three-diagonal matrix in a structural algorithmic algebra ⋮ Stability and Convergence of Difference Approximations to Pseudo-Parabolic Partial Differential Equations ⋮ On two methods for elimination of non-unique solutions of an integral equation with logarithmic kernel/† ⋮ Multiparameter perturbation theory of matrices and linear operators ⋮ Pivot size in Gaussian elimination ⋮ Singular value decomposition and least squares solutions ⋮ Condition, equilibration and pivoting in linear algebraic systems ⋮ A constructive method for the solution of the stability problem ⋮ Monitoring the numerical stability of Gaussian elimination ⋮ On the Bauer's scaled condition number of matrices arising from approximate conformal mappings ⋮ On the stability of finite numerical procedures ⋮ A new method for the solution of the transport equation in slab geometry ⋮ Deflation techniques for the calculation of further solutions of a nonlinear system ⋮ Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems ⋮ Sequential Monte Carlo Techniques for Solving Non-Linear Systems ⋮ On an approach to integrating boundary problems with a non-unique solution ⋮ Rounding errors in numerical solutions of two linear equations in two unknowns ⋮ Triangular Factorization and Inversion by Fast Matrix Multiplication ⋮ Diagonal scaling of stiffness matrices in the Galerkin boundary element method ⋮ On Fourier-Toeplitz Methods for Separable Elliptic Problems ⋮ On the stability of finite numerical procedures ⋮ Restricted simplicial decomposition for convex constrained problems ⋮ Error-free computer solution of certain system of linear equations ⋮ On estimating the condition of eigenvalues and eigenvectors ⋮ The effective condition number applied to error analysis of certain boundary collocation methods ⋮ Necessary and sufficient conditions for the existence of weighted singular-valued decompositions of matrices with singular weights ⋮ A fine-grained block ILU scheme on regular structures for GPGPUs ⋮ Numerical algorithms for flows in the nodes of 2D models of pipe networks ⋮ Decomposition in multidimensional Boolean-optimization problems with sparse matrices ⋮ Generalization of Murty's direct algorithm to linear and convex quadratic programming ⋮ The weak and strong stability of algorithms in numerical linear algebra ⋮ Projection learning algorithm for threshold-controlled neural networks ⋮ Weighted pseudoinversion with singular weights ⋮ An algorithm to solve Hilbert systems of linear equations precisely ⋮ Algebraic and numerical techniques for the computation of matrix determinants ⋮ An upper bound on the growth ratio of Gaussian elimination ⋮ Accuracy and effectiveness of preconditioned conjugate gradient algorithms for large and ill-conditioned problems ⋮ Backward stability of a pivoting strategy for sign-regular linear systems ⋮ A new efficient solution method for a system of linear equations: Partially Solving Method (PSM) ⋮ A self-correcting matrix iteration for the Moore-Penrose generalized inverse ⋮ Combined methods of solution of systems of linear algebraic equations ⋮ On the spectrum of a nonsingular matrix ⋮ Remarks on the complexity of roundoff analysis ⋮ On systems of linear equations of the form \(A^tAx=b\); error analysis and certain consequences for structural applications ⋮ Étude statistique des erreurs dans l'ARITHM<ETIQUE DES ORDINATEURS, APPLICATIONS AU CONTR<OLE DES R<ESULTTS D'algorithmes numériques ⋮ Stability of fast algorithms for matrix multiplication ⋮ Computational methods of linear algebra ⋮ A novel convergence accelerator for the LMS adaptive filter ⋮ Finite-difference methods for computing the steady flow about blunt bodies ⋮ Eigenproblems associated with the discrete LBB condition for incompressible finite elements ⋮ The accuracy of least squares calculations with the Cholesky algorithm ⋮ A study of MBH-type realization algorithms ⋮ Neville elimination: An efficient algorithm with application to chemistry ⋮ Rustishauser's modified method for computing the eigenvalues of symmetric matrices ⋮ Necessary and sufficient conditions for the existence of a weighted singular value decomposition of matrices with singular weights ⋮ Global solution algorithm with some assisting techniques for modeling of unsteady flow in centrifuge cascade pipe network ⋮ An algorithm to solve integer linear systems exactly using numerical methods ⋮ Gaussian elimination: When is scaling beneficial! ⋮ Numerical tools for geoscience computations: semiautomatic differentiation-SD ⋮ Representations and expansions of weighted pseudoinverse matrices, iterative methods, and problem regularization. I. positive definite weights ⋮ Cubic spline interpolation to develop contours of large reservoirs and evaluate area and volume ⋮ Backward error analysis of Neville elimination ⋮ Rounding-error and perturbation bounds for the Cholesky and \(LDL^ T\) factorizations ⋮ Error analysis of digital filters using HOL theorem proving ⋮ Symbolic Cholesky decomposition of the variance-covariance matrix of the negative multinomial distribution ⋮ A nonlinear least squares search algorithm ⋮ Engineering applications of ADI methods to piecewise linear multidimensional heat transfer ⋮ A converse to the Bauer-Fike theorem
This page was built for publication: