Basic Linear Algebra Subprograms for Fortran Usage
From MaRDI portal
Publication:4199445
DOI10.1145/355841.355847zbMath0412.65022OpenAlexW1988425770WikidataQ56455007 ScholiaQ56455007MaRDI QIDQ4199445
Fred T. Krogh, Charles L. Lawson, David R. Kincaid, Richard J. Hanson
Publication date: 1979
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2060/19780018835
Fortranvector normGivens transformationdot productvector scalingsubprogramsbasic operations of numerical linear algebra
Software, source code, etc. for problems pertaining to linear algebra (15-04) Numerical linear algebra (65F99) Software, source code, etc. for problems pertaining to numerical analysis (65-04)
Related Items (only showing first 100 items - show all)
Finding a positive semidefinite interval for a parametric matrix ⋮ Towards an efficient use of the BLAS library for multilinear tensor contractions ⋮ An overview of NSPCG: A nonsymmetric preconditioned conjugate gradient package ⋮ Development of an object-oriented finite element program: application to metal-forming and impact simulations ⋮ Running air pollution models on the connection machine ⋮ PROFIL/BIAS - A fast interval library ⋮ An efficient parallel block coordinate descent algorithm for large-scale precision matrix estimation using graphics processing units ⋮ Analytical solutions for a single blade in vertical axis turbine motion in two-dimensions ⋮ SOLUTION OF LARGE LINEAR SYSTEMS ON PIPELINED SIMD MACHINES ⋮ Linear algebra on high performance computers ⋮ Fast implementation for semidefinite programs with positive matrix completion ⋮ A survey of the advances in the exploitation of the sparsity in the solution of large problems ⋮ Partial singular value decomposition algorithm ⋮ The design of a parallel dense linear algebra software library: Reduction to Hessenberg, tridiagonal, and bidiagonal form ⋮ The semantics and complexity of parallel programs for vector computations. I: A case study using Ada ⋮ Self-scaling fast rotations for stiff and equality-constrained linear least squares problems ⋮ A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix ⋮ Parallel benchmarks of turbulence in complex geometries ⋮ High-performance numerical algorithms and software for subspace-based linear multivariable system identification ⋮ On vectorizing the preconditioned generalized conjugate residual methods ⋮ The aggregation and cancellation techniques as a practical tool for faster matrix multiplication ⋮ Explicit parallel block Cholesky algorithms on the CRAY APP ⋮ High performance solution of partial differential equations discretized using a Chebyshev spectral collocation method ⋮ Parallel solution of almost block diagonal systems on a hypercube ⋮ High performance verified computing using C-XSC ⋮ A generalization of \(s\)-step variants of gradient methods ⋮ Julia: A Fresh Approach to Numerical Computing ⋮ Local computation of homology variations over a construction process ⋮ Peridynamic elastic waves in two-dimensional unbounded domains: construction of nonlocal Dirichlet-type absorbing boundary conditions ⋮ Implementation of a generalized exponential basis functions method for linear and non‐linear problems ⋮ On large scale nonlinear network optimization ⋮ A highly efficient implementation of a backpropagation learning algorithm using matrix ISA ⋮ Codes for almost block diagonal systems ⋮ Parallel Jacobian-free Newton Krylov solution of the discrete ordinates method with flux limiters for 3D radiative transfer ⋮ A domain-decomposing parallel sparse linear system solver ⋮ Comparison of two pivotal strategies in sparse plane rotations ⋮ Sparse direct factorizations through unassembled hyper-matrices ⋮ The \textsc{deal.II} finite element library: design, features, and insights ⋮ A combined three-dimensional finite element and scattering matrix method for the analysis of plane wave diffraction by bi-periodic, multilayered structures ⋮ High-efficiency improved symmetric successive over-relaxation preconditioned conjugate gradient method for solving large-scale finite element linear equations ⋮ Deriving dense linear algebra libraries ⋮ An efficient hybrid MLFMA-FFT solver for the volume integral equation in case of sparse 3D inhomogeneous dielectric scatterers ⋮ Vectorizing codes for studying long-range transport of air pollutants ⋮ Numerical determination of partial spectrum of Hermitian matrices using a Lánczos method with selective reorthogonalization ⋮ Parallel implementation of a multilevel modelling package ⋮ Parallel profiling of water distribution networks using the Clément formula ⋮ A simulator for adaptive parallel applications ⋮ Efficient FORTRAN implementation of the gaussian elimination and Householder reduction algorithms on the IBM 3090 vector multiprocessor ⋮ Comparisons of Gaussian elimination algorithms on a Cray Y-MP ⋮ The advantages of Fortran 90 ⋮ Fast bilinear algorithms for symmetric tensor contractions ⋮ Parallel multiprojection preconditioned methods based on subspace compression ⋮ High performance BLAS formulation of the multipole-to-local operator in the fast multipole method ⋮ Using Level 3 BLAS in Rotation-Based Algorithms ⋮ A data parallel finite element method for computational fluid dynamics on the Connection Machine system ⋮ On the use of flux limiters in the discrete ordinates method for 3D radiation calculations in absorbing and scattering media ⋮ Parallel FEM LES with one-equation subgrid-scale model for incompressible flows ⋮ Geostatistical hierarchical model for temporally integrated radon measurements ⋮ Newton-Krylov continuation of periodic orbits for Navier-Stokes flows ⋮ Parallel superconductor code on the iPSC/860 ⋮ Lattice quantum hadrodynamics on a CRAY Y-MP ⋮ Performance of parallel Cholesky factorization algorithms using BLAS ⋮ A friendly Fortran DDE solver ⋮ Low rank solution of data‐sparse Sylvester equations ⋮ The Mailman algorithm: a note on matrix-vector multiplication ⋮ CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm ⋮ Parallel nonnegative matrix factorization algorithm on the distributed memory platform ⋮ Accelerating scientific computations with mixed precision algorithms ⋮ Cache oblivious matrix multiplication using an element ordering based on a Peano curve ⋮ LAPACK-Based Condition Estimates for the Discrete-Time LQG Design ⋮ A new framework of GPU-accelerated spectral solvers: collocation and Galerkin methods for systems of coupled elliptic equations ⋮ The mimetic methods toolkit: an object-oriented API for mimetic finite differences ⋮ Reproducibility strategies for parallel preconditioned conjugate gradient ⋮ Performance and energy consumption of accurate and mixed-precision linear algebra kernels on GPUs ⋮ Solving Dense Interval Linear Systems with Verified Computing on Multicore Architectures ⋮ Exploiting hardware capabilities in interior point methods ⋮ Projection onto a Polyhedron that Exploits Sparsity ⋮ Unconstrained direct optimization of spacecraft trajectories using many embedded Lambert problems ⋮ Partial total least squares algorithm ⋮ Solving emission tomography problems on vector machines ⋮ BLIS: A Framework for Rapidly Instantiating BLAS Functionality ⋮ Reliable Generation of High-Performance Matrix Algebra ⋮ On efficient implementations of Kogbetliantz's algorithm for computing the singular value decomposition ⋮ Linear algebra software in IBM and CRAY computers ⋮ An algorithm for linear least squares problems with equality and nonnegativity constraints ⋮ Designing linear algebra algorithms on the IBM 3090 vector multiprocessor with a hierarchical memory system ⋮ Exploiting the separability in the solution of systems of linear ordinary differential equations ⋮ Graph based isomorph-free generation of two-level regular fractional factorial designs ⋮ ScaLAPACK: A portable linear algebra library for distributed memory computers -- design issues and performance ⋮ High-performance computing -- an overview ⋮ Mathematical software: Past, present, and future ⋮ Numerical algorithm delivery mechanisms ⋮ Distributed algebraic tearing and interconnecting techniques ⋮ Improved Gram-Schmidt type downdating methods ⋮ Numerical linear algebra algorithms and software ⋮ The impact of high-performance computing in the solution of linear systems: Trends and problems ⋮ Procedures for optimization problems with a mixture of bounds and general linear constraints ⋮ A block varaint of the GMRES method for unsymmetric linear systems ⋮ Parallel Cholesky factorization on a shared-memory multiprocessor ⋮ Squeezing the most out of eigenvalue solvers on high-performance computers
This page was built for publication: Basic Linear Algebra Subprograms for Fortran Usage
