𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized pseudospectral methods with mappings for bound and resonance state problems

✍ Scribed by Guanhua Yao; Shih-I Chu

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
674 KB
Volume
204
Category
Article
ISSN
0009-2614

No coin nor oath required. For personal study only.

✦ Synopsis

Several extensions of the pseudospectral method are made and applied to the solution of bound and resonance state problems. First, an algebraic mapping is introduced to remove the singularity and the domain truncation error common to Coulomb problems. In addition, the conventional procedure is modified, leading to a more desirable symmetric eigenvalue problem instead of an unsymmetric or generalized one. The simplicity, efficiency, and accuracy of the procedures are illustrated by solving the oneelectron Dirac equation. Finally a new complex-scaling pseudospectral method is introduced for resonance state problems and applied to the determination of the complex resonance energies for an anharmonic oscillator.

📜 SIMILAR VOLUMES

A method for generating magnetic resonan
A method for generating magnetic resonance microimaging T2 maps with low sensitivity to diffusion
✍ Vladimír Mlynárik; Anna Degrassi; Renato Toffanin; Orest Jarh; Franco Vittur 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 329 KB

## Abstract Generating __T__~2~ maps in magnetic resonance microimaging is often complicated by the self‐diffusion of water molecules. A modification of the standard spin‐echo pulse sequence is proposed which minimizes this effect. Experiments with doped water confirmed that the __T__~2~ values obt

General Further Discarding Tests in Geom
General Further Discarding Tests in Geometric Branch-and-Bound Methods for Non-Convex Multicriteria Optimization Problems
✍ Daniel Scholz 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 387 KB

## ABSTRACT Using a geometric branch‐and‐bound technique, my goal in this paper is to compute a sharp outer approximation of all Pareto‐optimal solutions in multicriteria optimization problems. To this end, I propose some general further discarding tests that are based on the Fritz John necessary c

Generalized alternating-direction colloc
Generalized alternating-direction collocation methods for parabolic equations. II. Transport equations with application to seawater intrusion problems
✍ Michael A. Celia; George F. Pinder 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 641 KB

## Abstract The alternating‐direction collocation (ADC) method combines the attractive computational features of a collocation spatial approximation and an alternating‐direction time marching algorithm. The result is a very efficient solution procedure for parabolic partial differential equations.