Fast Structured Spectral Methods
|
|
- Sherman Todd
- 5 years ago
- Views:
Transcription
1 Spectral methods HSS structures Fast algorithms Conclusion Fast Structured Spectral Methods Yingwei Wang Department of Mathematics, Purdue University Joint work with Prof Jie Shen and Prof Jianlin Xia Workshop on Fast Direct Solvers Nov 13, 2016 Yingwei Wang Fast Structured Spectral Methods 1 / 32
2 Spectral methods HSS structures Fast algorithms Conclusion Talk Outline 1 Introduction to spectral methods 2 Low-rank property and structured matrices 3 Fast direct solvers and transforms 4 Concluding remarks and future work Yingwei Wang Fast Structured Spectral Methods 2 / 32
3 Spectral methods HSS structures Fast algorithms Conclusion Introduction Dense matrices Outline 1 Introduction to spectral methods Finite elements vs. spectral methods Where do the dense matrices come from 2 Low-rank property and structured matrices 3 Fast direct solvers and transforms 4 Concluding remarks and future work Yingwei Wang Fast Structured Spectral Methods 3 / 32
4 Spectral methods HSS structures Fast algorithms Conclusion Introduction Dense matrices Numerical PDEs Many successful numerical methods for differential equations aim at approximating the unknown function by a sum u N (x) = N u n ϕ n (x), (1) n=0 where {ϕ n (x)} N n=0 are prescribed basis functions and {u n} N n=0 are unknown coefficients to be determined. Yingwei Wang Fast Structured Spectral Methods 4 / 32
5 Spectral methods HSS structures Fast algorithms Conclusion Introduction Dense matrices Numerical PDEs Many successful numerical methods for differential equations aim at approximating the unknown function by a sum u N (x) = N u n ϕ n (x), (1) n=0 where {ϕ n (x)} N n=0 are prescribed basis functions and {u n} N n=0 are unknown coefficients to be determined. Two ways to choose polynomial basis set {φ n (x)} N n=0 : 1 Local basis sets: piecewise polynomials of low degrees (e.g., piecewise constant, linear, quadratic, etc). 2 Global basis sets: (orthogonal) polynomials of high degrees defined in the whole interval. Yingwei Wang Fast Structured Spectral Methods 4 / 32
6 Spectral methods HSS structures Fast algorithms Conclusion Introduction Dense matrices φ 0 (x) φ 1 (x) φ 2 (x) φ 0 (x) φ 2 (x) 0.5 φ 1 (x) Figure : Basis functions: finite elements vs. spectral methods (3) Yingwei Wang Fast Structured Spectral Methods 5 / 32
7 Spectral methods HSS structures Fast algorithms Conclusion Introduction Dense matrices Figure : Basis functions: finite elements vs. spectral methods (9) Yingwei Wang Fast Structured Spectral Methods 6 / 32
8 Spectral methods HSS structures Fast algorithms Conclusion Introduction Dense matrices Spectral methods vs. finite element methods Finite element methods: Local basis: piecewise linear functions in P 1 FE. Rate of convergence: O(h) = O(N 1 ). Most widely used tools. u u h H 1 h u H 1. (2) Spectral methods: Global basis: orthogonal polynomials/trigonometric functions Significant advantage: high-order rate of convergence. u u N X N σ(m) u H m, (3) where σ(m) > 0 is the so-called order of convergence in terms of the regularity index m. Main difficulties: irregular domains, singular solutions, high dimensional problems, nonlinear equations, unbounded domains, dense linear systems, etc. Yingwei Wang Fast Structured Spectral Methods 7 / 32
9 Spectral methods HSS structures Fast algorithms Conclusion Introduction Dense matrices My ongoing research topics Table : Challenges of spectral methods and our strategies Challenges Strategies Irregular domain Petrov-Galerkin Unbounded domain Mapped Chebyshev functions Corner singularity Müntz-Galerkin methods High dimensionality Sparse grids Nonlinear equations Two-level algorithm Dense matrices Fast Structured Spectral Methods Yingwei Wang Fast Structured Spectral Methods 8 / 32
10 Spectral methods HSS structures Fast algorithms Conclusion Introduction Dense matrices Where do the dense matrices come from? (1) Spectral Galerkin approximation to the elliptic equation with variable coefficients leads to α(x)u (β(x) u) = f (x) (4) (M α + S β )u = f, (5) where the mass M and stiffness S matrices could be banded or totally dense. (2) The transforms between coefficients of orthogonal polynomials expansion and function values are also dense. (3) The k-th order differential matrices D (k) in spectral collocation methods are full matrices. Yingwei Wang Fast Structured Spectral Methods 9 / 32
11 Spectral methods HSS structures Fast algorithms Conclusion Introduction Dense matrices Goal of this project When the order of the matrix N is large, the O(N 3 ) operations and O(N 2 ) storage required by common dense numerical linear algebra become overwhelmingly expensive. The main goal of this project is to reduce the computational cost of high order spectral methods from O(N 3 ) to nearly optimal complexity O(N log N) as other low order methods. Yingwei Wang Fast Structured Spectral Methods 10 / 32
12 Spectral methods HSS structures Fast algorithms Conclusion Introduction Dense matrices How to deal with dense linear systems? Iterative methods. An effective approach is to use a low-order method, such as finite-difference, finite-element, or integral operator as a preconditioner. [Canuto & Quarteroni 1985, Deville & Mund 1985, Greengard 1991, Coutsias & Hagstrom & Hesthaven & D. Torres 1996, Kim & Parter 1996, Parter 2001, Viswanath 2015]. Truncating the full matrix to a banded matrix, based on an essential assumption that the variable coefficients can be accurately approximated by low-order polynomials. [Olver & Townsend 2013]. Our strategy: low-rank property and hierarchically semiseparable (HSS) representation. Yingwei Wang Fast Structured Spectral Methods 11 / 32
13 Spectral methods HSS structures Fast algorithms Conclusion Low Rank Property Outline 1 Introduction to spectral methods 2 Low-rank property and structured matrices Low-rank property: Galerkin, transform, collocation Hierarchically semiseparable (HSS) structures 3 Fast direct solvers and transforms 4 Concluding remarks and future work Yingwei Wang Fast Structured Spectral Methods 12 / 32
14 Spectral methods HSS structures Fast algorithms Conclusion Low Rank Property Fourier- and Chebyshev-Galerkin methods We restrict our attention to the 1D elliptic equation: α(x)u (β(x)u x ) x = f (x), x (a, b), (6) with Dirichlet or periodical boundary conditions. The Fourier- or Chebyshev-Galerkin formulation of the above problem leads to the following linear system where Au := (M α + S β )u = f, (7) M α = F D α F, (8) S β = D k F D β F D k. (9) Yingwei Wang Fast Structured Spectral Methods 13 / 32
15 Spectral methods HSS structures Fast algorithms Conclusion Low Rank Property Fourier- and Chebyshev-Galerkin methods We restrict our attention to the 1D elliptic equation: α(x)u (β(x)u x ) x = f (x), x (a, b), (6) with Dirichlet or periodical boundary conditions. The Fourier- or Chebyshev-Galerkin formulation of the above problem leads to the following linear system where Au := (M α + S β )u = f, (7) M α = F D α F, (8) S β = D k F D β F D k. (9) A matrix has the low-rank property if all its off-diagonal blocks have small ranks or numerical ranks. Yingwei Wang Fast Structured Spectral Methods 13 / 32
16 Spectral methods HSS structures Fast algorithms Conclusion Low Rank Property Low-rank property for smooth variable coefficients If both α and β are constants, then 1 Fourier : A is a diagonal matrix; 2 Chebyshev : rank(a 1:n,n+1:N ) 4 and rank(a n+1:n,1:n ) 4. Yingwei Wang Fast Structured Spectral Methods 14 / 32
17 Spectral methods HSS structures Fast algorithms Conclusion Low Rank Property Low-rank property for smooth variable coefficients If both α and β are constants, then 1 Fourier : A is a diagonal matrix; 2 Chebyshev : rank(a 1:n,n+1:N ) 4 and rank(a n+1:n,1:n ) 4. Theorem (Shen,W & Xia, 2016) If α(x) can be approximated by an r-term Fourier (or Chebyshev) series within a tolerance τ, then the numerical rank (with respect to the tolerance O(Nτ)) of any off-diagonal block of the following matrix is bounded by r: C F D α F (or F D α F ), where α = (α(x j )) N 1 j=0, D α = diag(α), F and F represent forward and backward disctrete Fourier (or Chebyshev) transforms. The above theorem immediately indicates the low rank property of the matrix A in (7). Yingwei Wang Fast Structured Spectral Methods 14 / 32
18 Spectral methods HSS structures Fast algorithms Conclusion Low Rank Property Low-rank property for coefficients with steep gradients If the variable coefficient α(x) has steep gradients, then the decay of the entries away from the diagonal is very slow. Fortunately, the low-rank property still holds. Yingwei Wang Fast Structured Spectral Methods 15 / 32
19 Spectral methods HSS structures Fast algorithms Conclusion Low Rank Property Low-rank property for coefficients with steep gradients If the variable coefficient α(x) has steep gradients, then the decay of the entries away from the diagonal is very slow. Fortunately, the low-rank property still holds x (i) Plot of α 4 (x) Index Index (ii) Entries of F α 4 (iii) Off-diagonal singular values 1 Figure : Plots of α 4(x) = , absolute 1000(x 0.5) x (x+0.5) 2 +1 values of the Chebyshev coefficients F α 4, and the first 200 singular values of the off-diagonal block ( F D α4 F ) 1: N 2, N +1:N, where N = Yingwei Wang Fast Structured Spectral Methods 15 / 32
20 Spectral methods HSS structures Fast algorithms Conclusion Low Rank Property Low-rank property for Chebyshev-Legendre transforms Consider two expansions of f (x) P N as follows N N f (x) = fn L L n (x) = fn T T n (x), x [ 1, 1], (10) n=0 n=0 where {L n } N n=0 and {T n} N n=0 are the Legendre and Chebyshev polynomials, respectively. The connection coefficients between Legendre and Chebyshev expansion are f L = K T L f T, f T = K L T f L. (11) Yingwei Wang Fast Structured Spectral Methods 16 / 32
21 Spectral methods HSS structures Fast algorithms Conclusion Low Rank Property Low-rank property for Chebyshev-Legendre transforms Consider two expansions of f (x) P N as follows N N f (x) = fn L L n (x) = fn T T n (x), x [ 1, 1], (10) n=0 n=0 where {L n } N n=0 and {T n} N n=0 are the Legendre and Chebyshev polynomials, respectively. The connection coefficients between Legendre and Chebyshev expansion are Theorem (Shen,W & Xia, 2016) f L = K T L f T, f T = K L T f L. (11) The backward and forward Cheyshev-Legendre transform matrices K L T = (κi,j L T ) and K T L = (κ T i,j L ) are of low numerical rank. More precisely, for given tolerance ɛ, the numerical HSS rank is r l = O ( log 2 (1/ɛ) log(log 1/ɛ) log N l ). Yingwei Wang Fast Structured Spectral Methods 16 / 32
22 Spectral methods HSS structures Fast algorithms Conclusion Low Rank Property Low-rank property for Chebyshev-Legendre transforms log(nl) log(log(nl)) Chebyshev-Legendre log(nl) log(log(nl)) Chebyshev-Legendre r l 30 r l N N l l (i) K T L (ii) K L T Figure : Numerical HSS ranks of Chebyshev-Legendre transforms The low rank property still holds for Chebyshev-Jacobi case and Jaocbi-Jacobi case. Yingwei Wang Fast Structured Spectral Methods 17 / 32
23 Spectral methods HSS structures Fast algorithms Conclusion Low Rank Property Low-rank property for differential matrices r r r D 1 D 1 D 1 D 2 D 2 D 2 35 O(log(N)) 35 O(log(N)) 35 O(log(N)) N N N (i)d (1) LGL and D(2) LGL (ii) D (1) CGL and D(2) CGL (iii) D (1) JGL and D(2) JGL Figure : The HSS ranks of Legendre, Chebyshev and Jacobi (α = 1/2, β = 2) differentiation matrices Yingwei Wang Fast Structured Spectral Methods 18 / 32
24 Spectral methods HSS structures Fast algorithms Conclusion HSS solver Jacobi Transforms Outline 1 Introduction to spectral methods 2 Low-rank property and structured matrices 3 Fast direct solvers and transforms HSS construction, factorization and solution Jacobi transforms with general indices 4 Concluding remarks and future work Yingwei Wang Fast Structured Spectral Methods 19 / 32
25 Spectral methods HSS structures Fast algorithms Conclusion HSS solver Jacobi Transforms Fast direct solver based on HSS structures Three stages of fast direct solver for Ax = f based on HSS. [Chandrasekaran et al 2005, 2006, Xia et al 2010,2012, 2013, 2016, Halko et al 2011, Martinsson 2016] 1 Construction. The storage required in HSS form is O(rN). Randomized scheme based on randomized sampling technique and matrix-vector multiplication. (Fourier- and Chebyshev Galerkin methods, Jacobi-Jacobi transforms). Analytic scheme based on explicit formula. (Differential matrices in spectral collocation methods). 2 Factorization. The factorization costs O(r 2 N) flops. 3 Solution. The solution stage costs O(rN) flops. Yingwei Wang Fast Structured Spectral Methods 20 / 32
26 Spectral methods HSS structures Fast algorithms Conclusion HSS solver Jacobi Transforms Fast direct solver based on HSS structures Three stages of fast direct solver for Ax = f based on HSS. [Chandrasekaran et al 2005, 2006, Xia et al 2010,2012, 2013, 2016, Halko et al 2011, Martinsson 2016] 1 Construction. The storage required in HSS form is O(rN). Randomized scheme based on randomized sampling technique and matrix-vector multiplication. (Fourier- and Chebyshev Galerkin methods, Jacobi-Jacobi transforms). Analytic scheme based on explicit formula. (Differential matrices in spectral collocation methods). 2 Factorization. The factorization costs O(r 2 N) flops. 3 Solution. The solution stage costs O(rN) flops. Applications in finite difference, finite element, boundary integral methods [Bebendorf 2003,2005, Martinsson & Rokhlin 2005, Martinsson 2009, Kong et al 2011, Schmitz & Ying 2012] and spectral methods [Lyons et al 2005, Gillman & Martinsson 2014]. Yingwei Wang Fast Structured Spectral Methods 20 / 32
27 Spectral methods HSS structures Fast algorithms Conclusion HSS solver Jacobi Transforms Example (Fourier-Galerkin method for problem with periodic BC) Consider the problem where α(x)u (β(x)u x ) x = f (x), x (0, π), (12) u (m) (0) = u (m) (2π), m = 0, 1, 2,..., (13) α(x) = cos(sin(x)), β(x) = 1 (tanh(γ(2x 3π)) + tanh( γ(2x π))), 2 f (x) = 1. Note that β(x) is a a square-wave -like function, which leads to two cusp points in the numerical solution. Yingwei Wang Fast Structured Spectral Methods 21 / 32
28 Spectral methods HSS structures Fast algorithms Conclusion HSS solver Jacobi Transforms Plot of β(x): a square-wave-like function x (i) Plot of β(x) Index (ii) Entries of F β(x) (iii) Off-diagonal singular values Figure : Plots of β(x) = 1 2 (tanh(10 (2x 3π)) + tanh(10 (2x π))), absolute values of the Fourier coefficients F β, and singular values of the off-diagonal block (F D β F ) 1: N 2, N 2 +1:N, where N = 320. Yingwei Wang Fast Structured Spectral Methods 22 / 32
29 Spectral methods HSS structures Fast algorithms Conclusion HSS solver Jacobi Transforms x Relative residue No preconditioner Jacobi preconditioner Iteration number Flops N (i) Numerical solution (ii) BiCGstab (iii) FSFGM Construction Factorization Solution Figure : Numerical results (γ = 10, N = 1280) Yingwei Wang Fast Structured Spectral Methods 23 / 32
30 Spectral methods HSS structures Fast algorithms Conclusion HSS solver Jacobi Transforms Example (Degenerate coefficients and Neumann BC) Consider the problem e x u (sin 2 (2πx)u x ) x = 1, x ( 1, 1), (14) u ( 1) = u (1) = 0, (15) x (i) Plot of β(x) = sin 2 (2πx) x (ii) Numerical solution Yingwei Wang Fast Structured Spectral Methods 24 / 32
31 Spectral methods HSS structures Fast algorithms Conclusion HSS solver Jacobi Transforms Numerical results Table : Backslash in Matlab Relative residue No preconditioner Jacobi preconditioner Iteration number Figure : BiCGstab methods Flops Construction Factorization Solution N Figure : Our method Time (s) N Error T B T B f T B s e e e e-11 Table : Our FSCGM Time (s) N Error T F T F c T F f T F s T F it e e e e e-10 Yingwei Wang Fast Structured Spectral Methods 25 / 32
32 Spectral methods HSS structures Fast algorithms Conclusion HSS solver Jacobi Transforms Fast structured Jacobi transforms Fast Structured Chebyshev-Jacobi transform (FSCJT): 1 Initialization. Construct HSS approximation to connection coefficients K with cost O(N 2 ) and store the generators in O(rN) memory; 2 Multiplication. Perform the matrix-vector product K v for any vector v with linear cost O(N). Yingwei Wang Fast Structured Spectral Methods 26 / 32
33 Spectral methods HSS structures Fast algorithms Conclusion HSS solver Jacobi Transforms Fast structured Jacobi transforms Fast Structured Chebyshev-Jacobi transform (FSCJT): 1 Initialization. Construct HSS approximation to connection coefficients K with cost O(N 2 ) and store the generators in O(rN) memory; 2 Multiplication. Perform the matrix-vector product K v for any vector v with linear cost O(N). Table : HSS construction cost and accuracy for Chebyshev-Legendre transform K T L K L T N t c e c t c e c e e e e e e e e e e e e-12 Yingwei Wang Fast Structured Spectral Methods 26 / 32
34 Spectral methods HSS structures Fast algorithms Conclusion HSS solver Jacobi Transforms Numerical tests: efficiency Flops Direct FSCLT CLTAF O(N) O(N(logN) 2 /loglogn) Flops Direct FSCLT CLTAF O(N) O(N(logN) 2 /loglogn) N (i) K L T N (ii) K T L Figure : Flops of Chebyshev-Legendre transforms FSCLT : Fast Structured Chebyshev-Legendre transform CLTAF : Cheyshev-Legendre transforms using an asymptotic formula [Hale & Townsend 2013] Yingwei Wang Fast Structured Spectral Methods 27 / 32
35 Spectral methods HSS structures Fast algorithms Conclusion HSS solver Jacobi Transforms Spectral collocation method: differential matrices Table : HSS construction errors of D (1) and D (2) (N = 640) r Legendre Chebyshev D (1) D (2) D (1) D (2) e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e-12 Yingwei Wang Fast Structured Spectral Methods 28 / 32
36 Spectral methods HSS structures Fast algorithms Conclusion FSSM framework Outline 1 Introduction to spectral methods 2 Low-rank property and structured matrices 3 Fast direct solvers and transforms 4 Concluding remarks and future work The framework of our fast structured spectral methods Yingwei Wang Fast Structured Spectral Methods 29 / 32
37 Spectral methods HSS structures Fast algorithms Conclusion FSSM framework The framework of FSSM The framework of Fast Structured Spectral Methods (FSSM) contains fast structured spectral Galerkin methods, fast structured spectral collocation methods and fast structured Jacobi transforms. Yingwei Wang Fast Structured Spectral Methods 30 / 32
38 Spectral methods HSS structures Fast algorithms Conclusion FSSM framework The framework of FSSM The framework of Fast Structured Spectral Methods (FSSM) contains fast structured spectral Galerkin methods, fast structured spectral collocation methods and fast structured Jacobi transforms. The ongoing work for two-dimensional elliptic equations. 1 Using HSS approximation plus eigen decomposition to solve the equation in separate form (a(x)u x ) x (b(y)u y ) y = f (x, y), (x, y) ( 1, 1) 2. (16) 2 Employing the solution of separate equation as the preconditioner to the non-separable equation (a(x, y) u(x, y)) = f (x, y), (x, y) ( 1, 1) 2. (17) J. Vogel, J. Xia, S. Cauley, and V. Balakrishnan, Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions, SIAM Journal on Scientific Computing, 38 (2016), pp. A1358 A1382. Yingwei Wang Fast Structured Spectral Methods 30 / 32
39 Spectral methods HSS structures Fast algorithms Conclusion FSSM framework Preliminary results: 2D problems Flops Eigen solver Mat Vec O(N 2 ) N (i) Separable equation Relative residuals No preconditioner Preconditioned Number of iterations (ii) Non-separable equation Figure : Fast structured collocation methods for 2D problems The coefficient in non-separable equation is chosen as a(x, y; δ) = tanh ((x + y)/δ) tanh ((x y)/δ) + 2, (x, y) ( 1, 1) 2, δ = Yingwei Wang Fast Structured Spectral Methods 31 / 32
40 Spectral methods HSS structures Fast algorithms Conclusion FSSM framework References Jie Shen, Yingwei Wang, and Jianlin Xia, Fast Structured Direct Spectral Methods for Differential Equations with Variable Coefficients, I. The One-Dimensional Case, SIAM Journal on Scientific Computing, 38 (2016), pp. A28 A54. Jie Shen, Yingwei Wang, Jianlin Xia, Fast structured Jacobi-Jacobi transforms, submitted to Math Comp. Jie Shen, Yingwei Wang, Jianlin Xia, Fast structured spectral collocation methods, preprint. Questions? Yingwei Wang Fast Structured Spectral Methods 32 / 32
Key words. spectral method, structured matrix, low-rank property, matrix-free direct solver, linear complexity
SIAM J. SCI. COMPUT. Vol. 0, No. 0, pp. 000 000 c XXXX Society for Industrial and Applied Mathematics FAST STRUCTURED DIRECT SPECTRAL METHODS FOR DIFFERENTIAL EQUATIONS WITH VARIABLE COEFFICIENTS, I. THE
More informationarxiv: v1 [math.na] 4 Nov 2015
ON WELL-CONDITIONED SPECTRAL COLLOCATION AND SPECTRAL METHODS BY THE INTEGRAL REFORMULATION KUI DU arxiv:529v [mathna 4 Nov 25 Abstract Well-conditioned spectral collocation and spectral methods have recently
More informationFractional Spectral and Spectral Element Methods
Fractional Calculus, Probability and Non-local Operators: Applications and Recent Developments Nov. 6th - 8th 2013, BCAM, Bilbao, Spain Fractional Spectral and Spectral Element Methods (Based on PhD thesis
More informationA FAST SOLVER FOR ELLIPTIC EQUATIONS WITH HARMONIC COEFFICIENT APPROXIMATIONS
Proceedings of ALGORITMY 2005 pp. 222 229 A FAST SOLVER FOR ELLIPTIC EQUATIONS WITH HARMONIC COEFFICIENT APPROXIMATIONS ELENA BRAVERMAN, MOSHE ISRAELI, AND ALEXANDER SHERMAN Abstract. Based on a fast subtractional
More informationPreliminary Examination, Numerical Analysis, August 2016
Preliminary Examination, Numerical Analysis, August 2016 Instructions: This exam is closed books and notes. The time allowed is three hours and you need to work on any three out of questions 1-4 and any
More informationAn Accurate Fourier-Spectral Solver for Variable Coefficient Elliptic Equations
An Accurate Fourier-Spectral Solver for Variable Coefficient Elliptic Equations Moshe Israeli Computer Science Department, Technion-Israel Institute of Technology, Technion city, Haifa 32000, ISRAEL Alexander
More informationEffective matrix-free preconditioning for the augmented immersed interface method
Effective matrix-free preconditioning for the augmented immersed interface method Jianlin Xia a, Zhilin Li b, Xin Ye a a Department of Mathematics, Purdue University, West Lafayette, IN 47907, USA. E-mail:
More informationAMS 529: Finite Element Methods: Fundamentals, Applications, and New Trends
AMS 529: Finite Element Methods: Fundamentals, Applications, and New Trends Lecture 3: Finite Elements in 2-D Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Finite Element Methods 1 / 18 Outline 1 Boundary
More informationFast direct solvers for elliptic PDEs
Fast direct solvers for elliptic PDEs Gunnar Martinsson The University of Colorado at Boulder PhD Students: Tracy Babb Adrianna Gillman (now at Dartmouth) Nathan Halko (now at Spot Influence, LLC) Sijia
More informationThe Conjugate Gradient Method
The Conjugate Gradient Method Classical Iterations We have a problem, We assume that the matrix comes from a discretization of a PDE. The best and most popular model problem is, The matrix will be as large
More informationSolving Symmetric Indefinite Systems with Symmetric Positive Definite Preconditioners
Solving Symmetric Indefinite Systems with Symmetric Positive Definite Preconditioners Eugene Vecharynski 1 Andrew Knyazev 2 1 Department of Computer Science and Engineering University of Minnesota 2 Department
More informationMultilevel low-rank approximation preconditioners Yousef Saad Department of Computer Science and Engineering University of Minnesota
Multilevel low-rank approximation preconditioners Yousef Saad Department of Computer Science and Engineering University of Minnesota SIAM CSE Boston - March 1, 2013 First: Joint work with Ruipeng Li Work
More informationLecture 1: Introduction
CBMS Conference on Fast Direct Solvers Dartmouth College June June 7, 4 Lecture : Introduction Gunnar Martinsson The University of Colorado at Boulder Research support by: Many thanks to everyone who made
More informationA fast and well-conditioned spectral method: The US method
A fast and well-conditioned spectral method: The US method Alex Townsend University of Oxford Leslie Fox Prize, 24th of June 23 Partially based on: S. Olver & T., A fast and well-conditioned spectral method,
More informationNumerical Methods I Non-Square and Sparse Linear Systems
Numerical Methods I Non-Square and Sparse Linear Systems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 September 25th, 2014 A. Donev (Courant
More informationFast algorithms for hierarchically semiseparable matrices
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. 2010; 17:953 976 Published online 22 December 2009 in Wiley Online Library (wileyonlinelibrary.com)..691 Fast algorithms for hierarchically
More informationM.A. Botchev. September 5, 2014
Rome-Moscow school of Matrix Methods and Applied Linear Algebra 2014 A short introduction to Krylov subspaces for linear systems, matrix functions and inexact Newton methods. Plan and exercises. M.A. Botchev
More informationEfficient Solvers for Stochastic Finite Element Saddle Point Problems
Efficient Solvers for Stochastic Finite Element Saddle Point Problems Catherine E. Powell c.powell@manchester.ac.uk School of Mathematics University of Manchester, UK Efficient Solvers for Stochastic Finite
More informationNumerical Analysis Comprehensive Exam Questions
Numerical Analysis Comprehensive Exam Questions 1. Let f(x) = (x α) m g(x) where m is an integer and g(x) C (R), g(α). Write down the Newton s method for finding the root α of f(x), and study the order
More informationLecture 9 Approximations of Laplace s Equation, Finite Element Method. Mathématiques appliquées (MATH0504-1) B. Dewals, C.
Lecture 9 Approximations of Laplace s Equation, Finite Element Method Mathématiques appliquées (MATH54-1) B. Dewals, C. Geuzaine V1.2 23/11/218 1 Learning objectives of this lecture Apply the finite difference
More informationLinear Solvers. Andrew Hazel
Linear Solvers Andrew Hazel Introduction Thus far we have talked about the formulation and discretisation of physical problems...... and stopped when we got to a discrete linear system of equations. Introduction
More informationOverlapping Schwarz preconditioners for Fekete spectral elements
Overlapping Schwarz preconditioners for Fekete spectral elements R. Pasquetti 1, L. F. Pavarino 2, F. Rapetti 1, and E. Zampieri 2 1 Laboratoire J.-A. Dieudonné, CNRS & Université de Nice et Sophia-Antipolis,
More informationPreface to the Second Edition. Preface to the First Edition
n page v Preface to the Second Edition Preface to the First Edition xiii xvii 1 Background in Linear Algebra 1 1.1 Matrices................................. 1 1.2 Square Matrices and Eigenvalues....................
More information256 Summary. D n f(x j ) = f j+n f j n 2n x. j n=1. α m n = 2( 1) n (m!) 2 (m n)!(m + n)!. PPW = 2π k x 2 N + 1. i=0?d i,j. N/2} N + 1-dim.
56 Summary High order FD Finite-order finite differences: Points per Wavelength: Number of passes: D n f(x j ) = f j+n f j n n x df xj = m α m dx n D n f j j n= α m n = ( ) n (m!) (m n)!(m + n)!. PPW =
More informationMATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 34: Improving the Condition Number of the Interpolation Matrix Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu
More informationThe automatic solution of PDEs using a global spectral method
The automatic solution of PDEs using a global spectral method 2014 CBMS-NSF Conference, 29th June 2014 Alex Townsend PhD student University of Oxford (with Sheehan Olver) Supervised by Nick Trefethen,
More informationResearch Statement. James Bremer Department of Mathematics, University of California, Davis
Research Statement James Bremer Department of Mathematics, University of California, Davis Email: bremer@math.ucdavis.edu Webpage: https.math.ucdavis.edu/ bremer I work in the field of numerical analysis,
More informationA Method for Constructing Diagonally Dominant Preconditioners based on Jacobi Rotations
A Method for Constructing Diagonally Dominant Preconditioners based on Jacobi Rotations Jin Yun Yuan Plamen Y. Yalamov Abstract A method is presented to make a given matrix strictly diagonally dominant
More informationSemi-implicit Krylov Deferred Correction Methods for Ordinary Differential Equations
Semi-implicit Krylov Deferred Correction Methods for Ordinary Differential Equations Sunyoung Bu University of North Carolina Department of Mathematics CB # 325, Chapel Hill USA agatha@email.unc.edu Jingfang
More informationA Novel Aggregation Method based on Graph Matching for Algebraic MultiGrid Preconditioning of Sparse Linear Systems
A Novel Aggregation Method based on Graph Matching for Algebraic MultiGrid Preconditioning of Sparse Linear Systems Pasqua D Ambra, Alfredo Buttari, Daniela Di Serafino, Salvatore Filippone, Simone Gentile,
More informationA WELL-CONDITIONED COLLOCATION METHOD USING A PSEUDOSPECTRAL INTEGRATION MATRIX
A WELL-CONDITIONED COLLOCATION METHOD USING A PSEUDOSPECTRAL INTEGRATION MATRIX LI-LIAN WANG, MICHAEL DANIEL SAMSON, AND XIAODAN ZHAO Abstract. In this paper, a well-conditioned collocation method is constructed
More informationMath 7824 Spring 2010 Numerical solution of partial differential equations Classroom notes and homework
Math 7824 Spring 2010 Numerical solution of partial differential equations Classroom notes and homework Jan Mandel University of Colorado Denver May 12, 2010 1/20/09: Sec. 1.1, 1.2. Hw 1 due 1/27: problems
More informationAPPLIED NUMERICAL LINEAR ALGEBRA
APPLIED NUMERICAL LINEAR ALGEBRA James W. Demmel University of California Berkeley, California Society for Industrial and Applied Mathematics Philadelphia Contents Preface 1 Introduction 1 1.1 Basic Notation
More informationA direct solver for elliptic PDEs in three dimensions based on hierarchical merging of Poincaré-Steklov operators
(1) A direct solver for elliptic PDEs in three dimensions based on hierarchical merging of Poincaré-Steklov operators S. Hao 1, P.G. Martinsson 2 Abstract: A numerical method for variable coefficient elliptic
More informationLecture 18 Classical Iterative Methods
Lecture 18 Classical Iterative Methods MIT 18.335J / 6.337J Introduction to Numerical Methods Per-Olof Persson November 14, 2006 1 Iterative Methods for Linear Systems Direct methods for solving Ax = b,
More informationScientific Computing: Dense Linear Systems
Scientific Computing: Dense Linear Systems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course MATH-GA.2043 or CSCI-GA.2112, Spring 2012 February 9th, 2012 A. Donev (Courant Institute)
More informationNumerical Methods in Matrix Computations
Ake Bjorck Numerical Methods in Matrix Computations Springer Contents 1 Direct Methods for Linear Systems 1 1.1 Elements of Matrix Theory 1 1.1.1 Matrix Algebra 2 1.1.2 Vector Spaces 6 1.1.3 Submatrices
More informationInstructions for Matlab Routines
Instructions for Matlab Routines August, 2011 2 A. Introduction This note is devoted to some instructions to the Matlab routines for the fundamental spectral algorithms presented in the book: Jie Shen,
More informationFast Sparse Spectral Methods for Higher Dimensional PDEs
Fast Sparse Spectral Methods for Higher Dimensional PDEs Jie Shen Purdue University Collaborators: Li-Lian Wang, Haijun Yu and Alexander Alekseenko Research supported by AFOSR and NSF ICERM workshop, June
More informationPreconditioning for Nonsymmetry and Time-dependence
Preconditioning for Nonsymmetry and Time-dependence Andy Wathen Oxford University, UK joint work with Jen Pestana and Elle McDonald Jeju, Korea, 2015 p.1/24 Iterative methods For self-adjoint problems/symmetric
More informationIncomplete Cholesky preconditioners that exploit the low-rank property
anapov@ulb.ac.be ; http://homepages.ulb.ac.be/ anapov/ 1 / 35 Incomplete Cholesky preconditioners that exploit the low-rank property (theory and practice) Artem Napov Service de Métrologie Nucléaire, Université
More informationON SPECTRAL METHODS FOR VOLTERRA INTEGRAL EQUATIONS AND THE CONVERGENCE ANALYSIS * 1. Introduction
Journal of Computational Mathematics, Vol.6, No.6, 008, 85 837. ON SPECTRAL METHODS FOR VOLTERRA INTEGRAL EQUATIONS AND THE CONVERGENCE ANALYSIS * Tao Tang Department of Mathematics, Hong Kong Baptist
More informationPartial Differential Equations with Numerical Methods
Stig Larsson Vidar Thomée Partial Differential Equations with Numerical Methods May 2, 2003 Springer Berlin Heidelberg New York Barcelona Hong Kong London Milan Paris Tokyo Preface Our purpose in this
More informationCourse Notes: Week 1
Course Notes: Week 1 Math 270C: Applied Numerical Linear Algebra 1 Lecture 1: Introduction (3/28/11) We will focus on iterative methods for solving linear systems of equations (and some discussion of eigenvalues
More informationFast Numerical Methods for Stochastic Computations
Fast AreviewbyDongbinXiu May 16 th,2013 Outline Motivation 1 Motivation 2 3 4 5 Example: Burgers Equation Let us consider the Burger s equation: u t + uu x = νu xx, x [ 1, 1] u( 1) =1 u(1) = 1 Example:
More informationHierarchical Parallel Solution of Stochastic Systems
Hierarchical Parallel Solution of Stochastic Systems Second M.I.T. Conference on Computational Fluid and Solid Mechanics Contents: Simple Model of Stochastic Flow Stochastic Galerkin Scheme Resulting Equations
More informationIterative Methods for Solving A x = b
Iterative Methods for Solving A x = b A good (free) online source for iterative methods for solving A x = b is given in the description of a set of iterative solvers called templates found at netlib: http
More informationFinite Difference Methods (FDMs) 1
Finite Difference Methods (FDMs) 1 1 st - order Approxima9on Recall Taylor series expansion: Forward difference: Backward difference: Central difference: 2 nd - order Approxima9on Forward difference: Backward
More informationEigenvalue Problems CHAPTER 1 : PRELIMINARIES
Eigenvalue Problems CHAPTER 1 : PRELIMINARIES Heinrich Voss voss@tu-harburg.de Hamburg University of Technology Institute of Mathematics TUHH Heinrich Voss Preliminaries Eigenvalue problems 2012 1 / 14
More informationRational Chebyshev pseudospectral method for long-short wave equations
Journal of Physics: Conference Series PAPER OPE ACCESS Rational Chebyshev pseudospectral method for long-short wave equations To cite this article: Zeting Liu and Shujuan Lv 07 J. Phys.: Conf. Ser. 84
More informationAspects of Multigrid
Aspects of Multigrid Kees Oosterlee 1,2 1 Delft University of Technology, Delft. 2 CWI, Center for Mathematics and Computer Science, Amsterdam, SIAM Chapter Workshop Day, May 30th 2018 C.W.Oosterlee (CWI)
More informationFast direct solvers for elliptic PDEs
Fast direct solvers for elliptic PDEs Gunnar Martinsson The University of Colorado at Boulder Students: Adrianna Gillman (now at Dartmouth) Nathan Halko Sijia Hao Patrick Young (now at GeoEye Inc.) Collaborators:
More informationBoundary Value Problems - Solving 3-D Finite-Difference problems Jacob White
Introduction to Simulation - Lecture 2 Boundary Value Problems - Solving 3-D Finite-Difference problems Jacob White Thanks to Deepak Ramaswamy, Michal Rewienski, and Karen Veroy Outline Reminder about
More informationPartial Differential Equations
Partial Differential Equations Introduction Deng Li Discretization Methods Chunfang Chen, Danny Thorne, Adam Zornes CS521 Feb.,7, 2006 What do You Stand For? A PDE is a Partial Differential Equation This
More informationMultigrid absolute value preconditioning
Multigrid absolute value preconditioning Eugene Vecharynski 1 Andrew Knyazev 2 (speaker) 1 Department of Computer Science and Engineering University of Minnesota 2 Department of Mathematical and Statistical
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences)
AMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences) Lecture 19: Computing the SVD; Sparse Linear Systems Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical
More informationFast Multipole BEM for Structural Acoustics Simulation
Fast Boundary Element Methods in Industrial Applications Fast Multipole BEM for Structural Acoustics Simulation Matthias Fischer and Lothar Gaul Institut A für Mechanik, Universität Stuttgart, Germany
More informationLecture 8: Fast Linear Solvers (Part 7)
Lecture 8: Fast Linear Solvers (Part 7) 1 Modified Gram-Schmidt Process with Reorthogonalization Test Reorthogonalization If Av k 2 + δ v k+1 2 = Av k 2 to working precision. δ = 10 3 2 Householder Arnoldi
More informationA HIERARCHICAL 3-D DIRECT HELMHOLTZ SOLVER BY DOMAIN DECOMPOSITION AND MODIFIED FOURIER METHOD
SIAM J. SCI. COMPUT. Vol. 26, No. 5, pp. 1504 1524 c 2005 Society for Industrial and Applied Mathematics A HIERARCHICAL 3-D DIRECT HELMHOLTZ SOLVER BY DOMAIN DECOMPOSITION AND MODIFIED FOURIER METHOD E.
More informationSpectral Collocation Method for Parabolic Partial Differential Equations with Neumann Boundary Conditions
Applied Mathematical Sciences, Vol. 1, 2007, no. 5, 211-218 Spectral Collocation Method for Parabolic Partial Differential Equations with Neumann Boundary Conditions M. Javidi a and A. Golbabai b a Department
More informationApplications of Randomized Methods for Decomposing and Simulating from Large Covariance Matrices
Applications of Randomized Methods for Decomposing and Simulating from Large Covariance Matrices Vahid Dehdari and Clayton V. Deutsch Geostatistical modeling involves many variables and many locations.
More informationChapter Two: Numerical Methods for Elliptic PDEs. 1 Finite Difference Methods for Elliptic PDEs
Chapter Two: Numerical Methods for Elliptic PDEs Finite Difference Methods for Elliptic PDEs.. Finite difference scheme. We consider a simple example u := subject to Dirichlet boundary conditions ( ) u
More informationNumerical Linear Algebra Primer. Ryan Tibshirani Convex Optimization
Numerical Linear Algebra Primer Ryan Tibshirani Convex Optimization 10-725 Consider Last time: proximal Newton method min x g(x) + h(x) where g, h convex, g twice differentiable, and h simple. Proximal
More informationNumerical Mathematics
Alfio Quarteroni Riccardo Sacco Fausto Saleri Numerical Mathematics Second Edition With 135 Figures and 45 Tables 421 Springer Contents Part I Getting Started 1 Foundations of Matrix Analysis 3 1.1 Vector
More informationChapter 7 Iterative Techniques in Matrix Algebra
Chapter 7 Iterative Techniques in Matrix Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128B Numerical Analysis Vector Norms Definition
More informationT u
WANG LI-LIAN Assistant Professor Division of Mathematical Sciences, SPMS Nanyang Technological University Singapore, 637616 T 65-6513-7669 u 65-6316-6984 k lilian@ntu.edu.sg http://www.ntu.edu.sg/home/lilian?
More informationSolving the Stochastic Steady-State Diffusion Problem Using Multigrid
Solving the Stochastic Steady-State Diffusion Problem Using Multigrid Tengfei Su Applied Mathematics and Scientific Computing Advisor: Howard Elman Department of Computer Science Sept. 29, 2015 Tengfei
More informationScientific Computing with Case Studies SIAM Press, Lecture Notes for Unit VII Sparse Matrix
Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit VII Sparse Matrix Computations Part 1: Direct Methods Dianne P. O Leary c 2008
More informationNumerical Experiments for Finding Roots of the Polynomials in Chebyshev Basis
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 12, Issue 2 (December 2017), pp. 988 1001 Applications and Applied Mathematics: An International Journal (AAM) Numerical Experiments
More information9. Numerical linear algebra background
Convex Optimization Boyd & Vandenberghe 9. Numerical linear algebra background matrix structure and algorithm complexity solving linear equations with factored matrices LU, Cholesky, LDL T factorization
More informationEvaluation of Chebyshev pseudospectral methods for third order differential equations
Numerical Algorithms 16 (1997) 255 281 255 Evaluation of Chebyshev pseudospectral methods for third order differential equations Rosemary Renaut a and Yi Su b a Department of Mathematics, Arizona State
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 11 Partial Differential Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002.
More informationOutline. 1 Boundary Value Problems. 2 Numerical Methods for BVPs. Boundary Value Problems Numerical Methods for BVPs
Boundary Value Problems Numerical Methods for BVPs Outline Boundary Value Problems 2 Numerical Methods for BVPs Michael T. Heath Scientific Computing 2 / 45 Boundary Value Problems Numerical Methods for
More informationLinear algebra issues in Interior Point methods for bound-constrained least-squares problems
Linear algebra issues in Interior Point methods for bound-constrained least-squares problems Stefania Bellavia Dipartimento di Energetica S. Stecco Università degli Studi di Firenze Joint work with Jacek
More informationITERATIVE METHODS FOR SPARSE LINEAR SYSTEMS
ITERATIVE METHODS FOR SPARSE LINEAR SYSTEMS YOUSEF SAAD University of Minnesota PWS PUBLISHING COMPANY I(T)P An International Thomson Publishing Company BOSTON ALBANY BONN CINCINNATI DETROIT LONDON MADRID
More informationAlex Townsend Cornell University
Continuous analogues of Krylov methods for differential operators Alex Townsend Cornell University townsend@cornell.edu Joint work with: Marc Aurèle Gilles Based on Continuous analogues of Krylov methods
More informationMULTI-LAYER HIERARCHICAL STRUCTURES AND FACTORIZATIONS
MULTI-LAYER HIERARCHICAL STRUCTURES AND FACTORIZATIONS JIANLIN XIA Abstract. We propose multi-layer hierarchically semiseparable MHS structures for the fast factorizations of dense matrices arising from
More information9. Numerical linear algebra background
Convex Optimization Boyd & Vandenberghe 9. Numerical linear algebra background matrix structure and algorithm complexity solving linear equations with factored matrices LU, Cholesky, LDL T factorization
More informationH 2 -matrices with adaptive bases
1 H 2 -matrices with adaptive bases Steffen Börm MPI für Mathematik in den Naturwissenschaften Inselstraße 22 26, 04103 Leipzig http://www.mis.mpg.de/ Problem 2 Goal: Treat certain large dense matrices
More informationKasetsart University Workshop. Multigrid methods: An introduction
Kasetsart University Workshop Multigrid methods: An introduction Dr. Anand Pardhanani Mathematics Department Earlham College Richmond, Indiana USA pardhan@earlham.edu A copy of these slides is available
More informationCourse and Wavelets and Filter Banks
Course 18.327 and 1.130 Wavelets and Filter Bans Numerical solution of PDEs: Galerin approximation; wavelet integrals (projection coefficients, moments and connection coefficients); convergence Numerical
More informationANONSINGULAR tridiagonal linear system of the form
Generalized Diagonal Pivoting Methods for Tridiagonal Systems without Interchanges Jennifer B. Erway, Roummel F. Marcia, and Joseph A. Tyson Abstract It has been shown that a nonsingular symmetric tridiagonal
More informationPART IV Spectral Methods
PART IV Spectral Methods Additional References: R. Peyret, Spectral methods for incompressible viscous flow, Springer (2002), B. Mercier, An introduction to the numerical analysis of spectral methods,
More informationExploiting off-diagonal rank structures in the solution of linear matrix equations
Stefano Massei Exploiting off-diagonal rank structures in the solution of linear matrix equations Based on joint works with D. Kressner (EPFL), M. Mazza (IPP of Munich), D. Palitta (IDCTS of Magdeburg)
More informationIndex. higher order methods, 52 nonlinear, 36 with variable coefficients, 34 Burgers equation, 234 BVP, see boundary value problems
Index A-conjugate directions, 83 A-stability, 171 A( )-stability, 171 absolute error, 243 absolute stability, 149 for systems of equations, 154 absorbing boundary conditions, 228 Adams Bashforth methods,
More informationIntroduction. Chapter One
Chapter One Introduction The aim of this book is to describe and explain the beautiful mathematical relationships between matrices, moments, orthogonal polynomials, quadrature rules and the Lanczos and
More informationMultipole-Based Preconditioners for Sparse Linear Systems.
Multipole-Based Preconditioners for Sparse Linear Systems. Ananth Grama Purdue University. Supported by the National Science Foundation. Overview Summary of Contributions Generalized Stokes Problem Solenoidal
More informationComputer simulation of multiscale problems
Progress in the SSF project CutFEM, Geometry, and Optimal design Computer simulation of multiscale problems Axel Målqvist and Daniel Elfverson University of Gothenburg and Uppsala University Umeå 2015-05-20
More information7.2 Steepest Descent and Preconditioning
7.2 Steepest Descent and Preconditioning Descent methods are a broad class of iterative methods for finding solutions of the linear system Ax = b for symmetric positive definite matrix A R n n. Consider
More informationAn Efficient Low Memory Implicit DG Algorithm for Time Dependent Problems
An Efficient Low Memory Implicit DG Algorithm for Time Dependent Problems P.-O. Persson and J. Peraire Massachusetts Institute of Technology 2006 AIAA Aerospace Sciences Meeting, Reno, Nevada January 9,
More informationParallel Numerics, WT 2016/ Iterative Methods for Sparse Linear Systems of Equations. page 1 of 1
Parallel Numerics, WT 2016/2017 5 Iterative Methods for Sparse Linear Systems of Equations page 1 of 1 Contents 1 Introduction 1.1 Computer Science Aspects 1.2 Numerical Problems 1.3 Graphs 1.4 Loop Manipulations
More informationSpectral method for the unsteady incompressible Navier Stokes equations in gauge formulation
Report no. 04/09 Spectral method for the unsteady incompressible Navier Stokes equations in gauge formulation T. W. Tee I. J. Sobey A spectral method which uses a gauge method, as opposed to a projection
More informationSuboptimal feedback control of PDEs by solving Hamilton-Jacobi Bellman equations on sparse grids
Suboptimal feedback control of PDEs by solving Hamilton-Jacobi Bellman equations on sparse grids Jochen Garcke joint work with Axel Kröner, INRIA Saclay and CMAP, Ecole Polytechnique Ilja Kalmykov, Universität
More informationSolving PDEs with Multigrid Methods p.1
Solving PDEs with Multigrid Methods Scott MacLachlan maclachl@colorado.edu Department of Applied Mathematics, University of Colorado at Boulder Solving PDEs with Multigrid Methods p.1 Support and Collaboration
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 18 Outline
More information4.3 Eigen-Analysis of Spectral Derivative Matrices 203
. Eigen-Analysis of Spectral Derivative Matrices 8 N = 8 N = 6 6 6 8 8 8 8 N = 6 6 N = 6 6 6 (Round off error) 6 8 8 6 8 6 6 Fig... Legendre collocation first-derivative eigenvalues computed with 6-bit
More informationA Fast Direct Solver for a Class of Elliptic Partial Differential Equations
J Sci Comput (2009) 38: 316 330 DOI 101007/s10915-008-9240-6 A Fast Direct Solver for a Class of Elliptic Partial Differential Equations Per-Gunnar Martinsson Received: 20 September 2007 / Revised: 30
More informationAn Analysis of Five Numerical Methods for Approximating Certain Hypergeometric Functions in Domains within their Radii of Convergence
An Analysis of Five Numerical Methods for Approximating Certain Hypergeometric Functions in Domains within their Radii of Convergence John Pearson MSc Special Topic Abstract Numerical approximations of
More informationStabilization and Acceleration of Algebraic Multigrid Method
Stabilization and Acceleration of Algebraic Multigrid Method Recursive Projection Algorithm A. Jemcov J.P. Maruszewski Fluent Inc. October 24, 2006 Outline 1 Need for Algorithm Stabilization and Acceleration
More informationFAST STRUCTURED EIGENSOLVER FOR DISCRETIZED PARTIAL DIFFERENTIAL OPERATORS ON GENERAL MESHES
Proceedings of the Project Review, Geo-Mathematical Imaging Group Purdue University, West Lafayette IN, Vol. 1 2012 pp. 123-132. FAST STRUCTURED EIGENSOLVER FOR DISCRETIZED PARTIAL DIFFERENTIAL OPERATORS
More information