scientific article; zbMATH DE number 3183375

Cited in

(50)

Stochastic sensitivity analysis
An algorithm for the solution of ill-posed linear systems arising from the discretization of Fredholm integral equation of the first kind
On computing the eigenvalues of a symplectic pencil
Average condition number for solving linear equations
On the Round-Off Error in the Method of Successive Over-Relaxation
Error analysis for the stereological estimation of sphere size distribution: Abel type integral equation
Componentwise backward error analysis of Neville elimination
A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
Numerical behavior of LP algorithms based upon the decomposition principle
Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
Computing the eigenvalues of modified symmetric matrices
On accurate evaluation of extended sums
Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
Automatic computation of partial derivatives and rounding error estimates with applications to large-scale systems of nonlinear equations
Perturbation bounds of the Krylov bases and associated Hessenberg forms
Well-posed stochastic extensions of ill-posed linear problems
The accuracy of least squares calculations with the Cholesky algorithm
The simplex method is not always well behaved
Weitere unzulässige Abwandlungen der Vermutung von Wilkinson. (Further inadmissible amplifications of Wilkinson's conjecture)
Improvement of the resolution of an instrument by numerical solution of an integral equation
Inverse eigenvalue problems for Jacobi matrices
Condition number of the Krylov bases and subspaces
A new pivoting strategy for Gaussian elimination
Hybrid genetic deflated Newton method for global optimisation
Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
An alternative full-pivoting algorithm for the factorization of indefinite symmetric matrices
How ordinary elimination became Gaussian elimination
A matrix lower bound
Constructing blockmodels: how and why
Order invariant properties of some matrices
An extension of a theorem of Darroch and Ratcliff in loglinear models and its application to scaling multidimensional matrices
A variational approach to low Péclet number heat transfer in laminar flow
Report on test matrices for generalized inverses
A fast and stable parallel QR algorithm for symmetric tridiagonal matrices
An upper bound on the growth ratio of Gaussian elimination
Probabilistic analysis of complex Gaussian elimination without pivoting
A normalised algorithm for the solution of symmetric general five-term linear systems of semi-bandwidth M
Stability of the Richardson extrapolation combined with some implicit Runge-Kutta methods
Compatibility of approximate solutions of inaccurate linear equations
On Newton's method with a class of rational functions
A Schur method for the square root of a matrix
Structural analysis by matrix decomposition
Accuracy and stability of quaternion Gaussian elimination
Solving quadratic programs to high precision using scaled iterative refinement
Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
Error complexity analysis of two algorithms for computing powers of arbitrary Hessenberg matrices
A linear model for gauss elimination
Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
Extension of Henrici's method to matrix sequences
On iterative refinement of triangular linear algebraic systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3850185)