File: gee_its_sweet.m

package info (click to toggle)
suitesparse 1%3A5.12.0%2Bdfsg-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 176,720 kB
  • sloc: ansic: 1,193,914; cpp: 31,704; makefile: 6,638; fortran: 1,927; java: 1,826; csh: 765; ruby: 725; sh: 529; python: 333; perl: 225; sed: 164; awk: 35
file content (28 lines) | stat: -rw-r--r-- 1,479 bytes parent folder | download | duplicates (5)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
function x = gee_its_sweet (A, b)
% GEE_ITS_SWEET solves Ax=b with just x=A\b; it doesn't get sweeter than this
%
% Example:
%
%   x = gee_its_sweet (A,b) ;       % just does x=A\b, using backslash itself
%
% See also: mldivide

% I include the copyright below ... just to silence the Help Report ...  Yes,
% it's kind of silly to copyright a one-line code :-)  ... but then I do hold
% the copyright to perhaps a third to a half of the code used internally in
% MATLAB itself, to do x=A\b (UMFPACK, CHOLMOD, AMD, COLAMD, SPQR) along with
% co-authors Iain Duff, Patrick Amestoy, John Gilbert, Esmond Ng, and Stefan
% Larimore (CHOLMOD includes other code modules co-authored by Bill Hager,
% Morris Chen, and Siva Rajamanickam, but these do not appear in x=A\b).  The
% other part of x=A\b includes LAPACK and the BLAS (Dongarra et al), a sparse
% QR by John Gilbert, many other specialized solvers by Penny Anderson and Pat
% Quillen, and MA57 by Iain Duff.  Cleve Moler and Rob Schrieber have also
% worked on backslash.  The sparse case includes iterative refinement with
% sparse backward error (algorithm by Mario Arioli, Jim Demmel, and Iain Duff)
% but code by T. Davis.  I've probably left someone out of this cast of
% thousands because I haven't seen the code for mldivide (aka backslash), just
% LAPACK, the BLAS, and my codes.

% Copyright 2007, Timothy A. Davis, http://www.suitesparse.com

x = A\b ;   % I hearby call upon 250k lines of code (or so) to solve Ax=b