A general iterative sparse linear solver and its parallelization for interval Newton methods

DOI10.1007/BF02385256zbMath0837.65052OpenAlexW1584152251MaRDI QIDQ1904308

Chenyi Hu, Anna Frolov, Qing Yang, Ralph Baker Kearfott

Publication date: 1 February 1996

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02385256

zbMATH Keywords

performanceparallel algorithmsbisection methodsinterval Newton methodssparse Jacobian matrixindexed storage schemeiterative interval linear solversparse interval matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of solutions to systems of equations (65H10) Interval and finite arithmetic (65G30) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items (1)

Optimizing INTBIS on the CRAY Y-MP

Uses Software

• Harwell-Boeing sparse matrix collection

Cites Work

• Bounding solutions of systems of equations using interval analysis
• Parallel all-row preconditioned interval linear solver for nonlinear equations on multiprocessors
• Abstract Generalized Bisection and a Cost Bound
• Some tests of generalized bisection
• Sparse matrix test problems
• Algorithm 681: INTBIS, a portable interval Newton/bisection package
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A general iterative sparse linear solver and its parallelization for interval Newton methods