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