Numerical Linear Algebra - Computational Sciences - Lecture Slides, Slides of Computational Techniques

Computations Sciences course major topics are Bioinformatics, Cache Based Iterative Algorithms, Complex Domains, Computer Architecture, High Performance Computing, , Mpi and Openmpi, Nanotechnology, Networks. This lecture includes: Numerical Linear Algebra, Algebra, Scalars, Vectors, Types of Matrices, Dense Matrices, Band Matrices, Sparse Matrices, History of Nla, Computational Science Matrices

Typology: Slides

2012/2013

Uploaded on 08/30/2013

suneeta
suneeta 🇮🇳

4.8

(9)

81 documents

1 / 49

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Numerical Linear Algebra
docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d
pf2e
pf2f
pf30
pf31

Partial preview of the text

Download Numerical Linear Algebra - Computational Sciences - Lecture Slides and more Slides Computational Techniques in PDF only on Docsity!

Numerical Linear Algebra

What is Numerical Linear Algebra?• Ax = b• The same algebra learned in high school.

Common terms used in NLA (cont.)• Matrix – n

x

m 2-dimensional array of

values

Types of Matrices

  • Dense Matrices – most values are filled

Common terms used in NLA (cont.)• Eigenvalues – a scalar c such that, given

an n x n matrix A and a vector x, Ax = cx,the vector x is known as the Eigenvector

  • Least Squares Solution – a vector x in

Ax = b that minimizes the length of thevector Ax – b. A is an m x n matrix and ban m x 1 vector.

Numerical Linear Algebra

History

Hermann Grassman

H. Grassman (cont.)

  • “Father of Linear Algebra”•^

Wrote Die lineale Ausdehnungslehre, einneuer Zweig der Mathematik^ – Introduced exterior algebra– Symbols representing points, lines, etc. can

be manipulated using certain rules.

Johann Carl Friedrich Gauss

JCF Gauss (cont.)

  • Best known for Gaussian Elimination
    • Used to simplify Ax = b if A is a dense matrix
      • Math prodigy
        • Claimed to know the existence of non-

Euclidean geometry at 15 Contributed to astronomy

Arthur Caley (cont.)

  • Theory of Algebraic Invariances• Work with matrices
    • Developed foundation for quantum mechanics
      • Divided geometry into types
        • Euclidean, non-Euclidean, n-dimensional

Cholesky Decomposition

  • Used to simplify matrices that are

symmetric and positive definite

  • Used in parallel computing

Sparse Matrices: Fill

  • New non-zero elements introduced by

column modification

  • Preserving sparsity requires that we limit

fill

  • Finding optimal row, column ordering to

minimize fill is NP-complete combinatorialproblem