📄 dcompreg.cc
字号:
/* ARPACK++ v1.0 8/1/1997 c++ interface to ARPACK code. MODULE DCompReg.cc. Example program that illustrates how to solve a complex dense standard eigenvalue problem in regular mode using the ARluCompStdEig class. 1) Problem description: In this example we try to solve A*x = x*lambda in regular mode, where A is obtained from the standard central difference discretization of the convection-diffusion operator (Laplacian u) + rho*(du / dx) on the unit square [0,1]x[0,1] with zero Dirichlet boundary conditions. 2) Data structure used to represent matrix A: Although A is very sparse in this example, it is stored here columnwise as a dense matrix. 3) Included header files: File Contents ----------- --------------------------------------------- dcmatrxa.h CompMatrixA, a function that generates matrix A. ardnsmat.h The ARdsNonSymMatrix class definition. ardscomp.h The ARluCompStdEig class definition. lcompsol.h The Solution function. arcomp.h The "arcomplex" (complex) type definition. 4) ARPACK Authors: Richard Lehoucq Kristyn Maschhoff Danny Sorensen Chao Yang Dept. of Computational & Applied Mathematics Rice University Houston, Texas*/#include "arcomp.h"#include "ardscomp.h"#include "ardnsmat.h"#include "dcmatrxa.h"#include "lcompsol.h"main(){ // Defining variables; int nx; int n; // Dimension of the problem. arcomplex<double>* valA; // pointer to an array that stores // the elements of A. // Creating a complex matrix. nx = 10; CompMatrixA(nx, n, valA); ARdsNonSymMatrix<arcomplex<double> > A(n, valA); // Defining what we need: the four eigenvectors of A with largest magnitude. ARluCompStdEig<double> dprob(4L, A); // Finding eigenvalues and eigenvectors. dprob.FindEigenvectors(); // Printing solution. Solution(A, dprob);} // main
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -