default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Mathematical Software (TOMS), Volume 16, 1990
Volume 16, Number 1, March 1990
- Jack J. Dongarra, Jeremy Du Croz, Sven Hammarling, Iain S. Duff:
A set of level 3 basic linear algebra subprograms. 1-17 - Jack J. Dongarra, Jeremy Du Croz, Sven Hammarling, Iain S. Duff:
Algorithm 679; a set of level 3 basic linear algebra subprograms: model implementation and test programs. 18-28 - William J. Cody:
Performance evaluation of programs for the error and complementary error functions. 29-37 - G. P. M. Poppe, C. M. J. Wijers:
More efficient computation of the complex error function. 38-46 - G. P. M. Poppe, C. M. J. Wijers:
Algorithm 680: evaluation of the complex error function. 47 - David C. Arney, Joseph E. Flaherty:
An adaptive mesh-moving and local refinement method for time-dependent partial differential equations. 48-71 - Norman L. Schryer:
Designing software for one-dimensional partial differential equations. 72-85 - Eldon R. Hansen, Merrell L. Patrick, Richard L. C. Wang:
Polynomial evaluation with scaling. 86-93 - Dennis M. Snow:
Weyl group orbits. 94-108
Volume 16, Number 2, June 1990
- Stavros A. Zenios
:
Integrating network optimization capabilities into a high-level modeling language. 113-142 - Keith Meintjes, Alexander P. Morgan:
Chemical equilibrium systems as numerical test problems. 143-151 - R. Baker Kearfott, Manuel Novoa:
Algorithm 681: INTBIS, a portable interval Newton/bisection package. 152-157 - Almerico Murli, Mariarosaria Rizzardi:
Algorithm 682: Talbot's method of the Laplace inversion problems. 158-168 - Donald E. Amos:
Computation of exponential integrals of a complex argument. 169-177 - Donald E. Amos:
Algorithms 683: a portable FORTRAN subroutine for exponential integrals of a complex argument. 178-182
Volume 16, Number 3, September 1990
- Ping Tak Peter Tang:
Accurate and efficient testing of the exponential and logarithm functions. 185-200 - Jeff R. Cash, Alan H. Karp:
A variable order Runge-Kutta method for initial value problems with rapidly varying right-hand sides. 201-222 - Shlomo Weiss, James E. Smith:
A study of scalar compilation techniques for pipelined supercomputers. 223-245 - Albrecht Preusser:
Efficient formulation of a bivariate nonic C2-hermite polynomial on triangles. 246-252 - Albrecht Preusser:
Algorithm 684: C1- and C2-interplation on triangles with quintic and nonic bivariate polynomials. 253-257 - Orit Shacham, Mordechai Schacham:
Finding boundaries of the domain of definition for functions along a one-dimensional ray. 258-268 - Oscar Palacios-Velez:
A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems. 275-291
Volume 16, Number 4, December 1990
- Alex Pothen, Chin-Ju Fan:
Computing the block triangular form of a sparse matrix. 303-324 - Linda Kaufman, Daniel D. Warner:
Algorithm 658: a program for solving separable elliptic equations. 325-351 - Nicholas J. Higham:
Exploiting fast matrix multiplication within the level 3 BLAS. 352-368 - Lothar Reichel, William B. Gragg:
Algorithm 686: FORTRAN subroutines for updating the QR decomposition. 369-377 - Ping Tak Peter Tang:
Table-driven implementation of the logarithm function in IEEE floating-point arithmetic. 378-400 - Tim R. Hopkins:
Remark on algorithm 620. 401-403 - Donald E. Amos:
Remark on algorithm 644. 404 - Burton S. Garbow, James N. Lyness:
Remark on algorithm 662. 405-406
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
