scientific article; zbMATH DE number 3855012
From MaRDI portal
Publication:3323880
Recommendations
- Complexity of computer computations. Proceedings of a symposium on the complexity of computer computations, held March 20--22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, and sponsored by the Office of Naval Research, ma
- scientific article; zbMATH DE number 823961
- scientific article; zbMATH DE number 47339
- scientific article; zbMATH DE number 417606
- scientific article; zbMATH DE number 47824
Cited in
(19)- Iterative improvement of componentwise error bounds of invariant subspaces belonging to a double or nearly double eigenvalue
- Solving nonlinear parabolic problems with result verification. I: One- space dimensional case
- Coarse-grain parallelizations of interval algorithms decomposing dense matrices and solving triangular systems on multicomputers
- Implicit matrix multiplication with maximum accuracy on various transputer networks
- A circuit for exact summation of floating-point numbers
- A generalized integral quadratic method. I: An efficient solution for one-dimensional Volterra integral equation
- Parallel interval multisplittings
- Optimizing INTBIS on the CRAY Y-MP
- Arithmetically improved algorithmic performance
- Efficient methods for enclosing solutions of systems of nonlinear equations
- A numerical approach to the proof of existence of solutions for elliptic problems
- scientific article; zbMATH DE number 3930245 (Why is no real title available?)
- Interval arithmetic multistep methods for nonlinear systems of equations
- On Newton-like methods to enclose solutions of nonlinear equations
- On some Volterra and Fredholm problems via the unified integrodifferential quadrature method
- Numerical verification for solutions to partial differential equations
- FORTRAN-SC. A study of a FORTRAN extension for engineering/scientific computation with access to ACRITH
- Solving the linear least squares problem with very high relative accuracy
- Dense linear system: A parallel self-verified solver
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 Q3323880)
