Algorithm 679

swMATH12583MaRDI QIDQ24510FDOQ24510

Author name not available (Why is that?)

Cited In (64)

• A Set of Batched Basic Linear Algebra Subprograms and LAPACK Routines
• The RISC BLAS
• Blocked algorithms and software for reduction of a regular matrix pair to generalized Schur form
• Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software
• Fast inclusion of interval matrix multiplication
• Block and Parallel Versions of One-Sided Bidiagonalization
• Algorithm 784: GEMM-based level 3 BLAS
• Computer algebra systems - new strategies and techniques
• On Improving Linear Solver Performance: A Block Variant of GMRES
• The automatic generation of sparse primitives
• Full multi grid method for electric field computation in point-to-plane streamer discharge in air at atmospheric pressure
• Recursive blocked algorithms for solving triangular systems—Part I
• Title not available (Why is that?)
• Projection onto a polyhedron that exploits sparsity
• Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems
• Some Fast Algorithms for Sequentially Semiseparable Representations
• Computational Experience with a Modified Newton Solver for Discrete-Time Algebraic Riccati Equations
• Title not available (Why is that?)
• LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs
• Applying Automated Memory Analysis to Improve Iterative Algorithms
• Title not available (Why is that?)
• Algorithm 867
• Key concepts for parallel out-of-core LU factorization
• Efficient Matrix Multiplication on SIMD Computers
• GEMM-based level 3 BLAS
• Scalability of parallel spatial direct numerical simulations on Intel hypercube and IBM SP1 and SP2
• Free-surface film flow over topography: full three-dimensional finite element solutions
• High-performance numerical algorithms and software for subspace-based linear multivariable system identification
• Gaussian variant of Freivalds' algorithm for efficient and reliable matrix product verification
• Practical experience in the numerical dangers of heterogeneous computing
• Efficient Reduction of Banded Hermitian Positive Definite Generalized Eigenvalue Problems to Banded Standard Eigenvalue Problems
• Algorithm 1022: Efficient Algorithms for Computing a Rank-Revealing UTV Factorization on Parallel Computing Architectures
• Algorithm 979
• Numerical Issues in Statistical Computing for the Social Scientist
• Efficient computation of Hamiltonian matrix elements between non-orthogonal Slater determinants
• Fast and parallel interval arithmetic
• Improving performance of linear algebra algorithms for dense matrices, using algorithmic prefetch
• A fully asynchronous multifrontal solver using distributed dynamic scheduling
• PLASMA
• TTC
• Adaptive Winograd's matrix multiplications
• Renovating the collected algorithms from ACM
• Algorithm 679: A set of level 3 basic linear algebra subprograms: model implementation and test programs
• A Global Convergence Proof for Cyclic Jacobi Methods with Block Rotations
• GRASP92: a package for large-scale relativistic atomic structure calculations
• Exploiting parallelism in matrix-computation kernels for symmetric multiprocessor systems
• Accelerating scientific computations with mixed precision algorithms
• Communication lower bounds and optimal algorithms for numerical linear algebra
• A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
• Efficient computation of closed-loop frequency response for large-order flexible systems
• Level-3 Cholesky Factorization Routines Improve Performance of Many Cholesky Algorithms
• An MIMD strategy for quantum mechanical reactive scattering calculations
• Rectangular full packed format for cholesky's algorithm
• Multifrontal parallel distributed symmetric and unsymmetric solvers
• Title not available (Why is that?)
• Stability of block algorithms with fast level-3 BLAS
• Title not available (Why is that?)
• Block conjugate gradient algorithms for least squares problems
• Design of a High-Performance GEMM-like Tensor–Tensor Multiplication
• Title not available (Why is that?)
• Exploiting fast matrix multiplication within the level 3 BLAS
• Stabilization methods for quantum mechanical resonance states of four-body systems
• Performance evaluation of supercomputers using HPCC and IMB benchmarks
• A parallel block implementation of Level-3 BLAS for MIMD vector processors

This page was built for software: Algorithm 679