scientific article

From MaRDI portal
Publication:3850185

zbMath0113.10606MaRDI QIDQ3850185

J. H. Wilkinson

Publication date: 1960


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Hybrid genetic deflated Newton method for global optimisationAverage condition number for solving linear equationsError complexity analysis of two algorithms for computing powers of arbitrary Hessenberg matricesA fast and stable parallel QR algorithm for symmetric tridiagonal matricesStability of the Richardson extrapolation combined with some implicit Runge-Kutta methodsThe simplex method is not always well behavedAn extension of a theorem of Darroch and Ratcliff in loglinear models and its application to scaling multidimensional matricesPerturbation bounds of the Krylov bases and associated Hessenberg formsAn upper bound on the growth ratio of Gaussian eliminationA new pivoting strategy for Gaussian eliminationTraub-Gander's family for the simultaneous determination of multiple zeros of polynomialsAutomatic computation of partial derivatives and rounding error estimates with applications to large-scale systems of nonlinear equationsAn alternative full-pivoting algorithm for the factorization of indefinite symmetric matricesAccuracy and stability of quaternion Gaussian eliminationA normalised algorithm for the solution of symmetric general five-term linear systems of semi-bandwidth MOn Newton's method with a class of rational functionsThe accuracy of least squares calculations with the Cholesky algorithmA linear model for gauss eliminationWeitere unzulässige Abwandlungen der Vermutung von Wilkinson. (Further inadmissible amplifications of Wilkinson's conjecture)Componentwise backward error analysis of Neville eliminationComputing the eigenvalues of modified symmetric matricesStochastic sensitivity analysisA matrix lower boundOn iterative refinement of triangular linear algebraic systemsInverse eigenvalue problems for Jacobi matricesAccurate summation, dot product and polynomial evaluation in complex floating point arithmeticHow ordinary elimination became Gaussian eliminationConstructing blockmodels: how and whyNumerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologiesMatrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomialsOrder invariant properties of some matricesSolving quadratic programs to high precision using scaled iterative refinementOn accurate evaluation of extended sumsCompatibility of approximate solutions of inaccurate linear equationsOn computing the eigenvalues of a symplectic pencilOn the Round-Off Error in the Method of Successive Over-RelaxationWell-posed stochastic extensions of ill-posed linear problemsNumerical behavior of LP algorithms based upon the decomposition principleA variational approach to low Péclet number heat transfer in laminar flowImprovement of the resolution of an instrument by numerical solution of an integral equationProbabilistic analysis of complex Gaussian elimination without pivotingStructural analysis by matrix decompositionExtension of Henrici's method to matrix sequencesCondition number of the Krylov bases and subspacesA Schur method for the square root of a matrixAn algorithm for the solution of ill-posed linear systems arising from the discretization of Fredholm integral equation of the first kindA symplectic method for approximating all the eigenvalues of a Hamiltonian matrixReport on test matrices for generalized inversesAnalysis of the symmetric Lanczos algorithm with reorthogonalization methodsError analysis for the stereological estimation of sphere size distribution: Abel type integral equation




This page was built for publication: