Re: Lapack ?

From: Nicolas Neuss (my.name_at_iwr.uni-heidelberg.de)
Date: 05/12/04


Date: 12 May 2004 14:52:53 +0200

Martin Raspaud <mraspaud@labri.fr> writes:

> Hi all
>
> Does anyone know if there is a 100% Common lisp implementation of Lapack
> routines for matrix inversion ?
>
> Thanx
>
> Martin

My PDE toolbox Femlisp (<http://www.femlisp.org>) contains such code (basic
matrix arithmetic and Gauss elimination with pivoting) in the directory
"femlisp:src;matlisp;". It does matrix class generation and method
compilation adapted to the matrix element type at runtime and should
therefore be not much slower than ordinary LAPACK. However, the cache- and
architecture-optimized ATLAS routines (which can be used from CL with
Matlisp, see <http://matlisp.sourceforge.net/>) are much faster for
medium-sized and large matrices.

Yours, Nicolas.



Relevant Pages

  • Lapack ?
    ... Does anyone know if there is a 100% Common lisp implementation of Lapack ... routines for matrix inversion? ... Martin ...
    (comp.lang.lisp)
  • Re: Matrix Multiplication in BLAS or Lapack
    ... > so you need not to link the lapack library. ... > LAPACK library includes the blas routines already due to ... > BLAS offers the generic and simple routines, e.g. daxpy, dgemv, dgemm, ... > playing around with the optimization options of the compiler - ...
    (sci.math.num-analysis)
  • Re: sin(10^300), ignorance, collusion. was Re: TILE64 embedded multicore processors - Guy Macon
    ... And LAPACK gives reliable answers so long as the arithmetic isn't ... count routines for bisection, ... slower fall-backs for crap arithmetics. ... And there may be some optimizations ...
    (comp.arch)
  • Re: Matrix Multiplication in BLAS or Lapack
    ... BLAS-library and not of LAPACK; ... LAPACK library includes the blas routines already due to ... BLAS offers the generic and simple routines, e.g. daxpy, dgemv, dgemm, ... playing around with the optimization options of the compiler - ...
    (sci.math.num-analysis)
  • Re: Linear Algebra
    ... I was hoping that LAPACK would be the answer. ... There are separate LAPACK routines to compute s=Q^T.r. ... to solve the equations this way than the original normal equation ... the QR factorization approach requires fewer floating point ...
    (comp.lang.fortran)