Pages that link to "Item:Q62119"
From MaRDI portal
The following pages link to ACM Transactions on Mathematical Software (Q62119):
Displayed 50 items.
- Algorithm 894 (Q2989068) (← links)
- Anasazi software for the numerical solution of large-scale eigenvalue problems (Q2989069) (← links)
- Programming matrix algorithms-by-blocks for thread-level parallelism (Q2989071) (← links)
- Algorithm 895 (Q2989072) (← links)
- Algorithm 896 (Q2989073) (← links)
- Algorithm 897 (Q2989074) (← links)
- An Object-Oriented Design for Two-Dimensional Vortex Particle Methods (Q2989075) (← links)
- Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms (Q2989076) (← links)
- pyMDO (Q2989078) (← links)
- Accurate Numerical Integration of Perturbed Oscillatory Systems in Two Frequencies (Q2989079) (← links)
- ScaLAPACK's MRRR algorithm (Q2989080) (← links)
- Certification of bounds on expressions involving rounded operators (Q2989081) (← links)
- Design patterns for multiphysics modeling in Fortran 2003 and C++ (Q2989083) (← links)
- Computing correctly rounded integer powers in floating-point arithmetic (Q2989084) (← links)
- Singularity-free evaluation of collapsed-coordinate orthogonal polynomials (Q2989085) (← links)
- On the efficiency of symbolic computations combined with code generation for finite element methods (Q2989087) (← links)
- Cache-optimal algorithms for option pricing (Q2989088) (← links)
- Optimizations for quadrature representations of finite element tensors through automated code generation (Q2989090) (← links)
- Algorithm 898 (Q2989091) (← links)
- Algorithm 899 (Q2989092) (← links)
- Algorithm 900 (Q2989093) (← links)
- Algorithm 901 (Q2989094) (← links)
- EFCOSS (Q2989095) (← links)
- Efficient controls for finitely convergent sequential algorithms (Q2989096) (← links)
- Stepsize selection for ordinary differential equations (Q2989097) (← links)
- Efficient and formally proven reduction of large integers by small moduli (Q2989099) (← links)
- A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems (Q2989100) (← links)
- Rectangular full packed format for cholesky's algorithm (Q2989101) (← links)
- Scaling and pivoting in an out-of-core sparse direct solver (Q2989102) (← links)
- DOLFIN (Q2989103) (← links)
- Algorithm 902 (Q2989106) (← links)
- Algorithm 903 (Q2989107) (← links)
- Computing Tutte Polynomials (Q2989108) (← links)
- A Code Based on the Two-Stage Runge-Kutta Gauss Formula for Second-Order Initial Value Problems (Q2989109) (← links)
- Increasing the Reliability of Adaptive Quadrature Using Explicit Interpolants (Q2989110) (← links)
- Adaptive Projection Subspace Dimension for the Thick-Restart Lanczos Method (Q2989111) (← links)
- Unified Tables for Exponential and Logarithm Families (Q2989112) (← links)
- MLD2P4 (Q2989113) (← links)
- Parallel Colt (Q2989115) (← links)
- Parallel Solvers for Sylvester-Type Matrix Equations with Applications in Condition Estimation, Part I (Q2989116) (← links)
- Algorithm 904 (Q2989117) (← links)
- Algorithm 905 (Q2989119) (← links)
- Algorithm 906 (Q2989120) (← links)
- Algorithm 907 (Q2989122) (← links)
- Algorithm 908 (Q2989123) (← links)
- Partitioned Triangular Tridiagonalization (Q2989124) (← links)
- Solving Very Sparse Rational Systems of Equations (Q2989125) (← links)
- SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix (Q2989126) (← links)
- Costas Arrays (Q2989128) (← links)
- An Optimal Iterative Solver for Symmetric Indefinite Systems Stemming from Mixed Approximation (Q2989129) (← links)