Name
Title | ||
|---|---|---|
Matrix decomposition algorithms for the finite element Galerkin method with piecewise Hermite cubics |
Abstract | ||
|---|---|---|
Matrix decomposition algorithms (MDAs) employing fast Fourier transforms are developed for the solution of the systems of
linear algebraic equations arising when the finite element Galerkin method with piecewise Hermite bicubics is used to solve
Poisson’s equation on the unit square. Like their orthogonal spline collocation counterparts, these MDAs, which require O(N
2logN) operations on an N×N uniform partition, are based on knowledge of the solution of a generalized eigenvalue problem associated with the corresponding
discretization of a two-point boundary value problem. The eigenvalues and eigenfunctions are determined for various choices
of boundary conditions, and numerical results are presented to demonstrate the efficacy of the MDAs. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/s11075-008-9255-y | Numerical Algorithms |
Keywords | Field | DocType |
Elliptic boundary value problems,Finite element Galerkin method,Piecewise Hermite cubics,Generalized eigenvalue problem,Eigenvalues and eigenfunctions,Matrix decomposition algorithm,65F05,65N22,65N30 | Boundary knot method,Discontinuous Galerkin method,Mathematical optimization,Mathematical analysis,Matrix decomposition,Galerkin method,Algorithm,Hermite polynomials,Finite element method,Spectral method,Mathematics,Eigenvalues and eigenvectors | Journal |
Volume | Issue | ISSN |
52 | 1 | 1017-1398 |
Citations | PageRank | References |
2 | 0.40 | 2 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bernard Bialecki | 1 | 114 | 18.61 |
| Graeme Fairweather | 2 | 142 | 33.42 |
| David B. Knudson | 3 | 2 | 0.40 |
| D. Abram Lipman | 4 | 2 | 0.40 |
| Que N. Nguyen | 5 | 2 | 0.40 |
| Weiwei Sun | 6 | 154 | 15.12 |
| Gadalia M. Weinberg | 7 | 2 | 0.40 |