The Ritz vectors obtained by Arnoldi's method may not be good approxima- tions and even may not converge even if the corresponding Ritz values do. In order to improve the quality of Ritz vectors and enhance the e...The Ritz vectors obtained by Arnoldi's method may not be good approxima- tions and even may not converge even if the corresponding Ritz values do. In order to improve the quality of Ritz vectors and enhance the efficiency of Arnoldi type algorithms, we propose a strategy that uses Ritz values obtained from an m-dimensional Krylov subspace but chooses modified approximate eigenvectors in an (m + 1)-dimensional Krylov subspace. Residual norm of each new approximate eigenpair is minimal over the span of the Ritz vector and the (m+1)th basis vector, which is available when the m-step Arnoldi process is run. The resulting modi- fied m-step Arnoldi method is better than the standard m-step one in theory and cheaper than the standard (m + 1)-step one. Based on this strategy, we present a modified m-step restarted Arnoldi algorithm. Numerical examples show that the modified m-step restarted algorithm and its version with Chebyshev acceleration are often considerably more efficient than the standard (m+ 1)-step restarted ones.展开更多
As is well known, solving matrix multiple eigenvalue problems is a very difficult topic. In this paper, Arnoldi type algorithms are proposed for large unsymmetric multiple eigenvalue problems when the matrix A involve...As is well known, solving matrix multiple eigenvalue problems is a very difficult topic. In this paper, Arnoldi type algorithms are proposed for large unsymmetric multiple eigenvalue problems when the matrix A involved is diagonalizable. The theoretical background is established, in which lower and upper error bounds for eigenvectors are new for both Arnoldi's method and a general perturbation problem, and furthermore these bounds are shown to be optimal and they generalize a classical perturbation bound due to W. Kahan in 1967 for A symmetric. The algorithms can adaptively determine the multiplicity of an eigenvalue and a basis of the associated eigenspace. Numerical experiments show reliability of the algorithms.展开更多
The approximate eigenvectors or Ritz vectors obtained by the block Arnoldi method may converge very slowly and even fail to converge even if the approximate eigenvalues do. In order to improve the quality of the Ritz ...The approximate eigenvectors or Ritz vectors obtained by the block Arnoldi method may converge very slowly and even fail to converge even if the approximate eigenvalues do. In order to improve the quality of the Ritz vectors, a modified strategy is proposed such that new approximate eigenvectors are certain combinations of the Ritz vectors and the waSted (m+1) th block basis vector and their corresponding residual norms are minimized in a certain sense. They can be cheaply computed by solving a few small 'dimensional minimization problems. The resulting modified m-step block Arnoldi method is better than the standard m-step one in theory and cheaper than the standard (m+1)-step one. Based on this strategy, a modified m-step iterative block Arnoldi algorithm is presented. Numerical experiments are reported to show that the modified m-step algorithm is often considerably more efficient than the standard (m+1)-step iterative one.展开更多
We report our recent work on a second-order Krylov subspace and the corresponding second-order Arnoldi procedure for generating its orthonormal basis. The second-order Krylov subspace is spanned by a sequence of vecto...We report our recent work on a second-order Krylov subspace and the corresponding second-order Arnoldi procedure for generating its orthonormal basis. The second-order Krylov subspace is spanned by a sequence of vectors defined via a second-order linear homogeneous recurrence relation with coefficient matrices A and B and an initial vector u. It generalizes the well-known Krylov subspace K n(A;v), which is spanned by a sequence of vectors defined via a first-order linear homogeneous recurrence relation with a single coefficient matrix A and an initial vector v. The applications are shown for the solution of quadratic eigenvalue problems and dimension reduction of second-order dynamical systems. The new approaches preserve essential structures and properties of the quadratic eigenvalue problem and second-order system, and demonstrate superior numerical results over the common approaches based on linearization of these second-order problems.展开更多
In this paper we study the algorithms and their parallel implementation for solving large-scale generalized eigenvalue problems in modal analysis.Three predominant subspace algorithms,i.e.,Krylov-Schur method,implicit...In this paper we study the algorithms and their parallel implementation for solving large-scale generalized eigenvalue problems in modal analysis.Three predominant subspace algorithms,i.e.,Krylov-Schur method,implicitly restarted Arnoldi method and Jacobi-Davidson method,are modified with some complementary techniques to make them suitable for modal analysis.Detailed descriptions of the three algorithms are given.Based on these algorithms,a parallel solution procedure is established via the PANDA framework and its associated eigensolvers.Using the solution procedure on a machine equipped with up to 4800processors,the parallel performance of the three predominant methods is evaluated via numerical experiments with typical engineering structures,where the maximum testing scale attains twenty million degrees of freedom.The speedup curves for different cases are obtained and compared.The results show that the three methods are good for modal analysis in the scale of ten million degrees of freedom with a favorable parallel scalability.展开更多
We are interested in the numerical solution of the large nonsymmetric shifted linear system, （A ＋ αI）x -= b, for many different values of the shift a in a wide range. We apply the Saad＇s flexible preconditioning ...We are interested in the numerical solution of the large nonsymmetric shifted linear system, （A ＋ αI）x -= b, for many different values of the shift a in a wide range. We apply the Saad＇s flexible preconditioning technique to the solution of the shifted systems. Such flexible preconditioning with a few parameters could probably cover all the shifted systems with the shift in a wide range. Numerical experiments report the effectiveness of our approach on some problems.展开更多
As process technology development,model order reduction( MOR) has been regarded as a useful tool in analysis of on-chip interconnects. We propose a weighted self-adaptive threshold wavelet interpolation MOR method on ...As process technology development,model order reduction( MOR) has been regarded as a useful tool in analysis of on-chip interconnects. We propose a weighted self-adaptive threshold wavelet interpolation MOR method on account of Krylov subspace techniques. The interpolation points are selected by Haar wavelet using weighted self-adaptive threshold methods dynamically. Through the analyses of different types of circuits in very large scale integration( VLSI),the results show that the method proposed in this paper can be more accurate and efficient than Krylov subspace method of multi-shift expansion point using Haar wavelet that are no weighted self-adaptive threshold application in interest frequency range,and more accurate than Krylov subspace method of multi-shift expansion point based on the uniform interpolation point.展开更多
In this paper we reconsider the range-restricted GMRES (RRGMRES) method for solving nonsymmetric linear systems. We first review an important result for the usual GMRES method. Then we give an example to show that the...In this paper we reconsider the range-restricted GMRES (RRGMRES) method for solving nonsymmetric linear systems. We first review an important result for the usual GMRES method. Then we give an example to show that the range-restricted GMRES method does not admit such a result. Finally, we give a modified result for the range-restricted GMRES method. We point out that the modified version can be used to show that the range-restricted GMRES method is also a regularization method for solving linear ill-posed problems.展开更多
Based on Arnoldi's method, a version of generalized Arnoldi algorithm has been developed for the reduction of gyroscopic eigenvalue problems. By utilizing the skew symmetry of system matrix, a very simple recurren...Based on Arnoldi's method, a version of generalized Arnoldi algorithm has been developed for the reduction of gyroscopic eigenvalue problems. By utilizing the skew symmetry of system matrix, a very simple recurrence scheme, named gyroscopic Arnoldi reduction algorithm has been obtained, which is even simpler than the Lanczos algorithm for symmetric eigenvalue problems. The complex number computation is completely avoided. A restart technique is used to enable the reduction algorithm to have iterative characteristics. It has been found that the restart technique is not only effective for the convergence of multiple eigenvalues but it also furnishes the reduction algorithm with a technique to check and compute missed eigenvalues. By combining it with the restart technique, the algorithm is made practical for large-scale gyroscopic eigenvalue problems. Numerical examples are given to demonstrate the effectiveness of the method proposed.展开更多
An Arnoldi's method with new iteration pattern,which was designed for solving a large unsymmetric eigenvalue problem introduced by displacement-pressure FE (Finite Element) pattern of a fluid-structure interaction...An Arnoldi's method with new iteration pattern,which was designed for solving a large unsymmetric eigenvalue problem introduced by displacement-pressure FE (Finite Element) pattern of a fluid-structure interaction system,was adopted here to get the dynamic characteristics of the semi-submerged body. The new iteration pattern could be used efficiently to obtain the Arnoldi's vectors in the shift-frequency technique,which was used for the zero-frequency problem. Numerical example showed that the fluid-structure interaction is one of the important factors to the dynamic characteristics of large semi-submerged thin-walled structures.展开更多
Presents a study that investigated the generalization of the reverse order implicit Q-theorem and its truncated version to the unsymmetric case. Background on the application of the Arnoldi process formulations for a ...Presents a study that investigated the generalization of the reverse order implicit Q-theorem and its truncated version to the unsymmetric case. Background on the application of the Arnoldi process formulations for a Krylov subspace; Computation of the vector sequence and the resulting Hessenberg matrix; Numerical results.展开更多
Many applications require the solution of large nonsymmetric linear systems with multiple right hand sides. Instead of applying an iterative method to each of these systems individually, it is often more efficient to...Many applications require the solution of large nonsymmetric linear systems with multiple right hand sides. Instead of applying an iterative method to each of these systems individually, it is often more efficient to use a block version of the method that generates iterates for all the systems simultaneously. In this paper, we propose a block version of generalized minimum backward (GMBACK) for solving large multiple nonsymmetric linear systems. The new method employs the block Arnoldi process to construct a basis for the Krylov subspace K m(A, R 0) and seeks X m∈X 0+K m(A, R 0) to minimize the norm of the perturbation to the data given in A.展开更多
Arnoldi’s method and the incomplete orthogonalization method (IOM) for large non-Hermitian linear systerns are studied. It is shown that the inverse of a general nonsingular j × j Hessenberg matrir can be update...Arnoldi’s method and the incomplete orthogonalization method (IOM) for large non-Hermitian linear systerns are studied. It is shown that the inverse of a general nonsingular j × j Hessenberg matrir can be updated in O(j2) flops from that of its (j -1) × (j - 1) principal submatrir. The updating recursion of inverses of the Hessenberg matrices does not need any QR or LU decompostion as commonly used in the literature. Some updating recursions of the residual norms and the approximate solutions obtained by these two methods are derived. These results are appealing because they allow one to decide when the methods converge and show one how to compute approximate solutions very cheaply and easily.展开更多
This study develops a direct optimal growth algorithm for three-dimensional transient growth analysis of perturbations in channel flows which are globally stable but locally unstable. Different from traditional non-mo...This study develops a direct optimal growth algorithm for three-dimensional transient growth analysis of perturbations in channel flows which are globally stable but locally unstable. Different from traditional non-modal methods based on the Orr- Somrnerfeld and Squire （OSS） equations that assume simple base flows, this algorithm can be applied to arbitrarily complex base flows. In the proposed algorithm, a re- orthogonalization Arnoldi method is used to improve orthogonality of the orthogonal basis of the Krylov subspace generated by solving the linearized forward and adjoint Navier-Stokes （N-S） equations. The linearized adjoint N-S equations with the specific boundary conditions for the channel are derived, and a new convergence criterion is pro- posed. The algorithm is then applied to a one-dimensional base flow （the plane Poiseuille flow） and a two-dimensional base flow （the plane Poiseuille flow with a low-speed streak） in a channel. For one-dimensional cases, the effects of the spanwise width of the chan- nel and the Reynolds number on the transient growth of perturbations are studied. For two-dimensional cases, the effect of strength of initial low-speed streak is discussed. The presence of the streak in the plane Poiseuille flow leads to a larger and quicker growth of the perturbations than that in the one-dimensional case. For both cases, the results show that an optimal flow field leading to the largest growth of perturbations is character- ized by high- and low-speed streaks and the corresponding streamwise vortical structures. The lift-up mechanism that induces the transient growth of perturbations is discussed. The performance of the re-orthogonalization Arnoldi technique in the algorithm for both one- and two-dimensional base flows is demonstrated, and the algorithm is validated by comparing the results with those obtained from the OSS equations method and the cross- check method.展开更多
Abstract We develop a highly efficient scheme for numerically solving the three-dimensional time-dependent Schrödinger equation of the single-active-electron atom in the field of laser pulses by combining smooth ...Abstract We develop a highly efficient scheme for numerically solving the three-dimensional time-dependent Schrödinger equation of the single-active-electron atom in the field of laser pulses by combining smooth exterior complex scaling(SECS)absorbing method and Arnoldi propagation method.Such combination has not been reported in the literature.The proposed scheme is particularly useful in the applications involving long-time wave propagation.The SECS is a wonderful absorber,but its application results in a non-Hermitian Hamiltonian,invalidating propagators utilizing the Hermitian symmetry of the Hamiltonian.We demonstrate that the routine Arnoldi propagator can be modified to treat the non-Hermitian Hamiltonian.The efficiency of the proposed scheme is checked by tracking the time-dependent electron wave packet in the case of both weak extreme ultraviolet(XUV)and strong infrared(IR)laser pulses.Both perfect absorption and stable propagation are observed.展开更多
Factorization of the incompressible Stokes operator linking pressure and velocity is revisited.The main purpose is to use the inverse of the Stokes operator with a large time step as a preconditioner for Newton and Ar...Factorization of the incompressible Stokes operator linking pressure and velocity is revisited.The main purpose is to use the inverse of the Stokes operator with a large time step as a preconditioner for Newton and Arnoldi iterations applied to computation of steady three-dimensional flows and study of their stability.It is shown that the Stokes operator can be inversed within an acceptable computational effort.This inverse includes fast direct inverses of several Helmholtz operators and iterative inverse of the pressure matrix.It is shown,additionally,that fast direct solvers can be attractive for the inverse of the Helmholtz and Laplace operators on fine grids and at large Reynolds numbers,as well as for other problems where convergence of iterative methods slows down.Implementation of the Stokes operator inverse to time-steppingbased formulation of the Newton and Arnoldi iterations is discussed.展开更多
基金the China State Key Project for Basic Researchesthe National Natural Science Foundation of ChinaThe Research Fund for th
文摘The Ritz vectors obtained by Arnoldi's method may not be good approxima- tions and even may not converge even if the corresponding Ritz values do. In order to improve the quality of Ritz vectors and enhance the efficiency of Arnoldi type algorithms, we propose a strategy that uses Ritz values obtained from an m-dimensional Krylov subspace but chooses modified approximate eigenvectors in an (m + 1)-dimensional Krylov subspace. Residual norm of each new approximate eigenpair is minimal over the span of the Ritz vector and the (m+1)th basis vector, which is available when the m-step Arnoldi process is run. The resulting modi- fied m-step Arnoldi method is better than the standard m-step one in theory and cheaper than the standard (m + 1)-step one. Based on this strategy, we present a modified m-step restarted Arnoldi algorithm. Numerical examples show that the modified m-step restarted algorithm and its version with Chebyshev acceleration are often considerably more efficient than the standard (m+ 1)-step restarted ones.
文摘As is well known, solving matrix multiple eigenvalue problems is a very difficult topic. In this paper, Arnoldi type algorithms are proposed for large unsymmetric multiple eigenvalue problems when the matrix A involved is diagonalizable. The theoretical background is established, in which lower and upper error bounds for eigenvectors are new for both Arnoldi's method and a general perturbation problem, and furthermore these bounds are shown to be optimal and they generalize a classical perturbation bound due to W. Kahan in 1967 for A symmetric. The algorithms can adaptively determine the multiplicity of an eigenvalue and a basis of the associated eigenspace. Numerical experiments show reliability of the algorithms.
文摘The approximate eigenvectors or Ritz vectors obtained by the block Arnoldi method may converge very slowly and even fail to converge even if the approximate eigenvalues do. In order to improve the quality of the Ritz vectors, a modified strategy is proposed such that new approximate eigenvectors are certain combinations of the Ritz vectors and the waSted (m+1) th block basis vector and their corresponding residual norms are minimized in a certain sense. They can be cheaply computed by solving a few small 'dimensional minimization problems. The resulting modified m-step block Arnoldi method is better than the standard m-step one in theory and cheaper than the standard (m+1)-step one. Based on this strategy, a modified m-step iterative block Arnoldi algorithm is presented. Numerical experiments are reported to show that the modified m-step algorithm is often considerably more efficient than the standard (m+1)-step iterative one.
文摘We report our recent work on a second-order Krylov subspace and the corresponding second-order Arnoldi procedure for generating its orthonormal basis. The second-order Krylov subspace is spanned by a sequence of vectors defined via a second-order linear homogeneous recurrence relation with coefficient matrices A and B and an initial vector u. It generalizes the well-known Krylov subspace K n(A;v), which is spanned by a sequence of vectors defined via a first-order linear homogeneous recurrence relation with a single coefficient matrix A and an initial vector v. The applications are shown for the solution of quadratic eigenvalue problems and dimension reduction of second-order dynamical systems. The new approaches preserve essential structures and properties of the quadratic eigenvalue problem and second-order system, and demonstrate superior numerical results over the common approaches based on linearization of these second-order problems.
基金supported by the National Defence Basic Fundamental Research Program of China(Grant No.C1520110002)the Fundamental Development Foundation of China Academy Engineering Physics(Grant No.2012A0202008)
文摘In this paper we study the algorithms and their parallel implementation for solving large-scale generalized eigenvalue problems in modal analysis.Three predominant subspace algorithms,i.e.,Krylov-Schur method,implicitly restarted Arnoldi method and Jacobi-Davidson method,are modified with some complementary techniques to make them suitable for modal analysis.Detailed descriptions of the three algorithms are given.Based on these algorithms,a parallel solution procedure is established via the PANDA framework and its associated eigensolvers.Using the solution procedure on a machine equipped with up to 4800processors,the parallel performance of the three predominant methods is evaluated via numerical experiments with typical engineering structures,where the maximum testing scale attains twenty million degrees of freedom.The speedup curves for different cases are obtained and compared.The results show that the three methods are good for modal analysis in the scale of ten million degrees of freedom with a favorable parallel scalability.
基金Research supported by the National Natural Science Foundation of China （10271075）.
文摘We are interested in the numerical solution of the large nonsymmetric shifted linear system, （A ＋ αI）x -= b, for many different values of the shift a in a wide range. We apply the Saad＇s flexible preconditioning technique to the solution of the shifted systems. Such flexible preconditioning with a few parameters could probably cover all the shifted systems with the shift in a wide range. Numerical experiments report the effectiveness of our approach on some problems.
基金Sponsored by the Fundamental Research Funds for the Central Universities(Grant No.HIT.NSRIF.2016107)the China Postdoctoral Science Foundation(Grant No.2015M581447)
文摘As process technology development,model order reduction( MOR) has been regarded as a useful tool in analysis of on-chip interconnects. We propose a weighted self-adaptive threshold wavelet interpolation MOR method on account of Krylov subspace techniques. The interpolation points are selected by Haar wavelet using weighted self-adaptive threshold methods dynamically. Through the analyses of different types of circuits in very large scale integration( VLSI),the results show that the method proposed in this paper can be more accurate and efficient than Krylov subspace method of multi-shift expansion point using Haar wavelet that are no weighted self-adaptive threshold application in interest frequency range,and more accurate than Krylov subspace method of multi-shift expansion point based on the uniform interpolation point.
文摘In this paper we reconsider the range-restricted GMRES (RRGMRES) method for solving nonsymmetric linear systems. We first review an important result for the usual GMRES method. Then we give an example to show that the range-restricted GMRES method does not admit such a result. Finally, we give a modified result for the range-restricted GMRES method. We point out that the modified version can be used to show that the range-restricted GMRES method is also a regularization method for solving linear ill-posed problems.
基金This research is supported by The National Science FoundationThe Doctoral Training Foundation
文摘Based on Arnoldi's method, a version of generalized Arnoldi algorithm has been developed for the reduction of gyroscopic eigenvalue problems. By utilizing the skew symmetry of system matrix, a very simple recurrence scheme, named gyroscopic Arnoldi reduction algorithm has been obtained, which is even simpler than the Lanczos algorithm for symmetric eigenvalue problems. The complex number computation is completely avoided. A restart technique is used to enable the reduction algorithm to have iterative characteristics. It has been found that the restart technique is not only effective for the convergence of multiple eigenvalues but it also furnishes the reduction algorithm with a technique to check and compute missed eigenvalues. By combining it with the restart technique, the algorithm is made practical for large-scale gyroscopic eigenvalue problems. Numerical examples are given to demonstrate the effectiveness of the method proposed.
文摘An Arnoldi's method with new iteration pattern,which was designed for solving a large unsymmetric eigenvalue problem introduced by displacement-pressure FE (Finite Element) pattern of a fluid-structure interaction system,was adopted here to get the dynamic characteristics of the semi-submerged body. The new iteration pattern could be used efficiently to obtain the Arnoldi's vectors in the shift-frequency technique,which was used for the zero-frequency problem. Numerical example showed that the fluid-structure interaction is one of the important factors to the dynamic characteristics of large semi-submerged thin-walled structures.
基金Supported by the Special Funds for Major State Basic Research Projects (G1999032805), the Foundation for Excellent Young Scholars of the Ministry of Education, the Research Fund for the Doctoral Program of Higher Education and the Foundation for Key Teac
文摘Presents a study that investigated the generalization of the reverse order implicit Q-theorem and its truncated version to the unsymmetric case. Background on the application of the Arnoldi process formulations for a Krylov subspace; Computation of the vector sequence and the resulting Hessenberg matrix; Numerical results.
文摘Many applications require the solution of large nonsymmetric linear systems with multiple right hand sides. Instead of applying an iterative method to each of these systems individually, it is often more efficient to use a block version of the method that generates iterates for all the systems simultaneously. In this paper, we propose a block version of generalized minimum backward (GMBACK) for solving large multiple nonsymmetric linear systems. The new method employs the block Arnoldi process to construct a basis for the Krylov subspace K m(A, R 0) and seeks X m∈X 0+K m(A, R 0) to minimize the norm of the perturbation to the data given in A.
基金supported by the National Natural Science Foundation of China(61473148)the Natural Science Foundation of Jiangsu Province of China(BK20141408)Jiangsu Oversea Research and Training Program for University Prominent Young and Middle-aged Teachers and Presidents
文摘对于求解大规模二次特征值问题,叶强提出了一种迭代shift-and-invert Arnoldi投影算法(Ye Q.An iterated shift-and-invert Arnoldi algorithm for quadratic matrix eigenvalue problems.Appl Math Compt,2006,172:818-827).将这一策略推广到求解大规模三次特征值问题,基于改进的Krylov子空间,给出了求解大规模三次特征值问题的一种迭代shiftand-invert Arnoldi算法.结果表明,结合shift-and-invert技术,这是一种具有快速收敛性的高效算法.数值试验结果验证了算法的有效性.
文摘Arnoldi’s method and the incomplete orthogonalization method (IOM) for large non-Hermitian linear systerns are studied. It is shown that the inverse of a general nonsingular j × j Hessenberg matrir can be updated in O(j2) flops from that of its (j -1) × (j - 1) principal submatrir. The updating recursion of inverses of the Hessenberg matrices does not need any QR or LU decompostion as commonly used in the literature. Some updating recursions of the residual norms and the approximate solutions obtained by these two methods are derived. These results are appealing because they allow one to decide when the methods converge and show one how to compute approximate solutions very cheaply and easily.
基金supported by the National Natural Science Foundation of China(No.11372140)
文摘This study develops a direct optimal growth algorithm for three-dimensional transient growth analysis of perturbations in channel flows which are globally stable but locally unstable. Different from traditional non-modal methods based on the Orr- Somrnerfeld and Squire （OSS） equations that assume simple base flows, this algorithm can be applied to arbitrarily complex base flows. In the proposed algorithm, a re- orthogonalization Arnoldi method is used to improve orthogonality of the orthogonal basis of the Krylov subspace generated by solving the linearized forward and adjoint Navier-Stokes （N-S） equations. The linearized adjoint N-S equations with the specific boundary conditions for the channel are derived, and a new convergence criterion is pro- posed. The algorithm is then applied to a one-dimensional base flow （the plane Poiseuille flow） and a two-dimensional base flow （the plane Poiseuille flow with a low-speed streak） in a channel. For one-dimensional cases, the effects of the spanwise width of the chan- nel and the Reynolds number on the transient growth of perturbations are studied. For two-dimensional cases, the effect of strength of initial low-speed streak is discussed. The presence of the streak in the plane Poiseuille flow leads to a larger and quicker growth of the perturbations than that in the one-dimensional case. For both cases, the results show that an optimal flow field leading to the largest growth of perturbations is character- ized by high- and low-speed streaks and the corresponding streamwise vortical structures. The lift-up mechanism that induces the transient growth of perturbations is discussed. The performance of the re-orthogonalization Arnoldi technique in the algorithm for both one- and two-dimensional base flows is demonstrated, and the algorithm is validated by comparing the results with those obtained from the OSS equations method and the cross- check method.
基金the National Natural Science Foundation of China(Grant Nos.12074265 and 11804233).
文摘Abstract We develop a highly efficient scheme for numerically solving the three-dimensional time-dependent Schrödinger equation of the single-active-electron atom in the field of laser pulses by combining smooth exterior complex scaling(SECS)absorbing method and Arnoldi propagation method.Such combination has not been reported in the literature.The proposed scheme is particularly useful in the applications involving long-time wave propagation.The SECS is a wonderful absorber,but its application results in a non-Hermitian Hamiltonian,invalidating propagators utilizing the Hermitian symmetry of the Hamiltonian.We demonstrate that the routine Arnoldi propagator can be modified to treat the non-Hermitian Hamiltonian.The efficiency of the proposed scheme is checked by tracking the time-dependent electron wave packet in the case of both weak extreme ultraviolet(XUV)and strong infrared(IR)laser pulses.Both perfect absorption and stable propagation are observed.
文摘Factorization of the incompressible Stokes operator linking pressure and velocity is revisited.The main purpose is to use the inverse of the Stokes operator with a large time step as a preconditioner for Newton and Arnoldi iterations applied to computation of steady three-dimensional flows and study of their stability.It is shown that the Stokes operator can be inversed within an acceptable computational effort.This inverse includes fast direct inverses of several Helmholtz operators and iterative inverse of the pressure matrix.It is shown,additionally,that fast direct solvers can be attractive for the inverse of the Helmholtz and Laplace operators on fine grids and at large Reynolds numbers,as well as for other problems where convergence of iterative methods slows down.Implementation of the Stokes operator inverse to time-steppingbased formulation of the Newton and Arnoldi iterations is discussed.
