Basic Linear Algebra Subprograms for Fortran Usage
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Graph based isomorph-free generation of two-level regular fractional factorial designs
- Parallel Cholesky factorization on a shared-memory multiprocessor
- Squeezing the most out of eigenvalue solvers on high-performance computers
- Finding a positive semidefinite interval for a parametric matrix
- Linear algebra on high performance computers
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- The semantics and complexity of parallel programs for vector computations. I: A case study using Ada
- Comparison of two pivotal strategies in sparse plane rotations
- Vectorizing codes for studying long-range transport of air pollutants
- Comparisons of Gaussian elimination algorithms on a Cray Y-MP
- The advantages of Fortran 90
- A data parallel finite element method for computational fluid dynamics on the Connection Machine system
- ScaLAPACK: A portable linear algebra library for distributed memory computers -- design issues and performance
- High-performance computing -- an overview
- An overview of NSPCG: A nonsymmetric preconditioned conjugate gradient package
- Running air pollution models on the connection machine
- PROFIL/BIAS - A fast interval library
- A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
- Parallel benchmarks of turbulence in complex geometries
- Numerical linear algebra algorithms and software
- The impact of high-performance computing in the solution of linear systems: Trends and problems
- On efficient implementations of Kogbetliantz's algorithm for computing the singular value decomposition
- Linear algebra software in IBM and CRAY computers
- 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
- Mathematical software: Past, present, and future
- Numerical algorithm delivery mechanisms
- Development of an object-oriented finite element program: application to metal-forming and impact simulations
- The design of a parallel dense linear algebra software library: Reduction to Hessenberg, tridiagonal, and bidiagonal form
- Self-scaling fast rotations for stiff and equality-constrained linear least squares problems
- 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
- Parallel implementation of a multilevel modelling package
- Parallel multiprojection preconditioned methods based on subspace compression
- Unconstrained direct optimization of spacecraft trajectories using many embedded Lambert problems
- An efficient parallel block coordinate descent algorithm for large-scale precision matrix estimation using graphics processing units
- Local computation of homology variations over a construction process
- The \textsc{deal.II} finite element library: design, features, and insights
- Fast bilinear algorithms for symmetric tensor contractions
- Geostatistical hierarchical model for temporally integrated radon measurements
- Parallel nonnegative matrix factorization algorithm on the distributed memory platform
- Reproducibility strategies for parallel preconditioned conjugate gradient
- Performance and energy consumption of accurate and mixed-precision linear algebra kernels on GPUs
- Distributed algebraic tearing and interconnecting techniques
- 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
- High performance BLAS formulation of the multipole-to-local operator in the fast multipole method
- A friendly Fortran DDE solver
- Cache oblivious matrix multiplication using an element ordering based on a Peano curve
- 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
- Improved Gram-Schmidt type downdating methods
- Partial singular value decomposition algorithm
- Peridynamic elastic waves in two-dimensional unbounded domains: construction of nonlocal Dirichlet-type absorbing boundary conditions
- Towards an efficient use of the BLAS library for multilinear tensor contractions
- Exploiting hardware capabilities in interior point methods
- Projection onto a polyhedron that exploits sparsity
- BLIS: a framework for rapidly instantiating BLAS functionality
- Reliable generation of high-performance matrix algebra
- Julia: a fresh approach to numerical computing
- Implementation of a generalized exponential basis functions method for linear and non-linear problems
- Solving dense interval linear systems with verified computing on multicore architectures
- Fast implementation for semidefinite programs with positive matrix completion
- Parallel FEM LES with one-equation subgrid-scale model for incompressible flows
- Low rank solution of data-sparse Sylvester equations
- LAPACK-Based Condition Estimates for the Discrete-Time LQG Design
- Procedures for optimization problems with a mixture of bounds and general linear constraints
- Efficient FORTRAN implementation of the gaussian elimination and Householder reduction algorithms on the IBM 3090 vector multiprocessor
- High performance verified computing using C-XSC
- An algorithm for linear least squares problems with equality and nonnegativity constraints
- On vectorizing the preconditioned generalized conjugate residual methods
- A generalization of s-step variants of gradient methods
- A block varaint of the GMRES method for unsymmetric linear systems
- SOLUTION OF LARGE LINEAR SYSTEMS ON PIPELINED SIMD MACHINES
- A highly efficient implementation of a backpropagation learning algorithm using matrix ISA
- Using Level 3 BLAS in Rotation-Based Algorithms
- Parallel Jacobian-free Newton Krylov solution of the discrete ordinates method with flux limiters for 3D radiative transfer
- The singular value decomposition: anatomy of optimizing an algorithm for extreme scale
- High-Performance Tensor Contraction without Transposition
- The steady-state behavior of multivariate exponentially weighted moving average control charts
- Communication lower bounds and optimal algorithms for numerical linear algebra
- A robust and efficient implementation of LOBPCG
- Deriving dense linear algebra libraries
- A PARALLEL BLOCK LANCZOS ALGORITHM FOR DISTRIBUTED MEMORY ARCHITECTURES
- Numerical determination of partial spectrum of Hermitian matrices using a Lánczos method with selective reorthogonalization
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting
- <scp>Ginkgo</scp> : A Modern Linear Operator Algebra Framework for High Performance Computing
- From Iteration to System Failure: Characterizing the FITness of Periodic Weakly-Hard Systems
- A Distributed Interior-Point KKT Solver for Multistage Stochastic Optimization
- Transition to magnetorotational turbulence in Taylor-Couette flow with imposed azimuthal magnetic field
- Real-Time Radiation Treatment Planning with Optimality Guarantees via Cluster and Bound Methods
- Communication lower bounds of bilinear algorithms for symmetric tensor contractions
- A GPU-accelerated hybridizable discontinuous Galerkin method for linear elasticity
- Restructuring the tridiagonal and bidiagonal QR algorithms for performance
- The eigenvalues slicing library (EVSL): algorithms, implementation, and software
- Block Modified Gram--Schmidt Algorithms and Their Analysis
- Valuation of structured financial products by adaptive multiwavelet methods in high dimensions
- KBLAS: an optimized library for dense matrix-vector multiplication on GPU accelerators
- Analytical modeling is enough for high-performance BLIS
This page was built for publication: Basic Linear Algebra Subprograms for Fortran Usage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4199445)
