Discretization and solution of elliptic PDEs-a digital signal processing approach

@article{Kuo1990DiscretizationAS,
  title={Discretization and solution of elliptic PDEs-a digital signal processing approach},
  author={C.-C. Jay Kuo and Bernard C. Levy},
  journal={Proc. IEEE},
  year={1990},
  volume={78},
  pages={1808-1842}
}
A digital signal processing (DSP) approach is used to study numerical methods for discretizing and solving linear elliptic partial differential equations (PDEs). Whereas conventional PDE analysis techniques rely on matrix analysis and on a space-domain point of view to study the performance of solution methods, the DSP approach described here relies on frequency-domain analysis and on multidimensional DSP techniques. Both discretization schemes and solution methods are discussed. In the area of… 

Discrete simulation of linear multidimensional continuous systems

This paper presents the theoretical foundations of a new method for the discrete simulation of multidimensional systems, which are described by linear partial differential equations with constant

Preconditioning methods for improved convergence rates in iterative reconstructions

To increase reconstruction speed, spatially invariant preconditioning filters that can be designed using the tomographic system response and implemented using 2-D frequency-domain filtering techniques have been applied.

Methodology to estimate the relative pressure field from noisy experimental velocity data

The determination of intravascular pressure fields is important to the characterization of cardiovascular pathology. We present a two-stage method that solves the inverse problem of estimating the

Phase unwrapping of MR phase images using Poisson equation

The authors have developed a technique based on a solution of the Poisson equation to unwrap the phase in magnetic resonance (MR) phase images that is robust in the presence of noise and applies to the 3-point Dixon technique for water and fat separation.

A least squares based phase unwrapping algorithm for MRI

The authors have developed a technique based on a solution of the Poisson equation to unwrap the phase in magnetic resonance (MR) phase images. The method is based on the assumption that the

Simulation of linear continuous systems with distributed parameters

  • R. Rabenstein
  • Mathematics, Computer Science
    Simul. Pract. Theory
  • 1993

Recursive implementation of total least squares algorithm for image reconstruction from noisy, undersampled multiframes

It is shown how the total least squares recursive algorithm for the real data FIR (finite impulse response) adaptive filtering problem can be applied to reconstruct a high-resolution filtered image

Approximate Estimation of Functionals of the Solutions of Parabolic Equation under Nonlinearity in Output

The paper focuses on the minimax estimation approach used widely with signal processing. The paper deals with the problem of minimax estimating a functional from the solution of a parabolic equation

Determining cardiac velocity fields and intraventricular pressure distribution from a sequence of ultrafast CT cardiac images

A numerical algorithm developed by discretizing the pressure Poisson equation (PPE) can reconstruct the pressure distribution using only the velocity data and is shown to be robust in the presence of noise.

References

SHOWING 1-10 OF 88 REFERENCES

Mode-dependent finite-difference discretization of linear homogeneous differential equations

A new methodology utilizing the spectral analysis of local differential operators is proposed to design and analyze mode-dependent finite-difference schemes for linear homogeneous ordinary and

A LOCAL RELAXATION METHOD FOR SOLVING ELLIPTIC PDEs ON MESH-CONNECTED ARRAYS *

A local relaxation method for solving linear elliptic PDEs with O(N) processors and O(x/) computation time is proposed to achieve the acceleration effect with very little global communication in the loading stage.

A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation

Abstract : Several preconditioned conjugate gradient (PCG)-based domain decomposition techniques for self-adjoint elliptic partial differential equations in two dimensions are compared against each

Two-Color Fourier Analysis of Iterative Algorithms for Elliptic Problems with Red/Black Ordering

It is shown that although the red/black ordering does not affect the rate of convergence in the context of SOR and MG methods, it slows down the convergence significantly in the contexts of SSOR and preconditioned iterative methods.

Multi-level adaptive solutions to boundary-value problems math comptr

The boundary-value problem is discretized on several grids (or finite-element spaces) of widely different mesh sizes, enabling us to conveniently adapt the discretization to the evolving solution in a nearly optimal way, obtaining "°°-order" approximations and low n, even when singularities are present.

Fourier Analysis of Iterative Methods for Elliptic pr

A Fourier method for analyzing stationary iterative methods and preconditioners for discretized elliptic boundary value problems is presented, which essentially reproduce those of classical convergence and condition number analysis for problems with other boundary conditions, such as the Dirichlet problem.

A local relaxation method for solving PDEs on mesh-connected arrays

A local relaxation scheme is proposed to achieve the acceleration effect with very little global communication in the loading stage and the convergence rate of the local relaxation method is studied by computer simulation.

Analysis of preconditioners for domain decomposition

It is shown that for a simple model problem—Poisson’s equation on a rectangle decomposed into two smaller rectangles—the capacitance system can be inverted exactly by Fast Fourier Transform.

A survey of multilevel preconditioned iterative methods

We survey multilevel iterative methods applied for solving large sparse systems with matrices, which depend on a level parameter, such as arise by the discretization of boundary value problems for
...