A novel piecewise multivariate function approximation method via universal matrix representation

Multivariance in science and engineering causes problematic situations even for continous and discrete cases. One way to overcome this situation is to decrease the multivariance level of the problem by using a divide—and—conquer based method. In this sense, Enhanced Multivariance Product Representation (EMPR) plays a part in the considered scenario and acts successfully. This method brings up a finite expansion to represent a multivariate function in terms of less-variate functions with the assistance of univariate support functions. This work aims to propose a new EMPR based algorithm which has two new features that improves the determination process of each expansion component through Fluctuation Free Integration method, which is an efficient method in evaluating multiple integrals through a universal matrix representation, and increases the approximation quality through inserting a piecewise structure into the standard EMPR algorithm. This new method is called Fluctuation Free Integration based piecewise EMPR. Some numerical implementations are also given to examine the performance of this proposed method.     

Fitted electronic density functions from H to Rn for use in quantum similarity measures: cis-diamminedichloroplatinum(II) complex as an application example

A consistent set of fitted electronic density functions was generated for the elements from hydrogen to radon using an algorithm based on the elementary Jacobi rotations (EJR) technique. The main distinguishing attribute of this fitting procedure is the production of approximated electronic density functions with positive definite expansion coefficients; in this way, the statistical meaning of the probability distribution is preserved. The methodology, which was fully described previously, was modified in this work to improve and accelerate the fitting procedure. This variation concerns the optimization method employed to obtain the optimal angle of the EJR, implementing an algorithm based on a Taylor series expansion. Additionally, a new 1S-Type Gaussian basis set for atoms H to Rn is presented, that was fitted from a primitive basis set of Huzinaga. Fitted density functions facilitate theoretical calculations over large molecules and may be employed in many areas of computational chemistry, for example, in quantum similarity measures (QSM). To verify the basis set, a sound example related to QSM applications is given. This corresponds to the comparison of experimental structures obtained from X-ray determination for cis-diamminedichloroplatinum(II) complex with optimized molecular geometries using several theoretical methods to quantify the differences between the analyzed levels of theory. ©1999 John Wiley & Sons, Inc. J Comput Chem 20: 911–920, 1999     

Representation of Kohn–Sham free atom eigenfunctions by Slater‐type orbitals

Slater‐type orbitals are applied to represent the numerically obtained Kohn–Sham eigenfunction of free atom. The algorithm evaluating the nonlinear expansion coefficients of this approximation is described. Standard iterative solution of Kohn–Sham equation to obtain the nonlinear expansion coefficients is avoided and replaced by the projection method. First, the eigenfunction is obtained in the B‐spline space based on the Galerkin formulation of the finite element method. Then, based on the density functional theory, the conditions are formulated, which leads to the set of nonlinear equations. The proposed algorithm is general and can be applied for any atomic Kohn–Sham eigenfunction. As an examplary application of the proposed algorithm, the set of nonlinear equations is derived for occupied states of N, Al, Ga, and In atoms. The expansion coefficients, obtained for these atoms, are evaluated numerically by Newton procedure and listed in the tables. © 2008 Wiley Periodicals, Inc. Int J Quantum Chem, 2008     

Graphical representation of a new algorithm for nonorthogonalab initio valence bond calculations

A pictorial representation of the algorithm using successive expansion method for the nonorthogonal VB calculations is given. With the help of this representation and the graph analysis, the efficiency of this algorithm is improved and theN! problem is reduced by a factor of about (N!)^1/2. Anab initio VB program for valence bond self-consistent-field (VBSCF) calculations has been implemented based on this algorithm. Some VBSCF calculations have been performed for systems of up to 14 electrons. The statistics of the CPU time of the calculations indicate that this new group-theoretical approach is quite practical.     

A new algorithm for predicting triplet-triplet energy-transfer activated complex coordinate in terms of accurate potential-energy surfaces

The new algorithm presented here allows, for the first time, the determination of the optimal geometrical distortions that an acceptor molecule in the triplet-triplet energy-transfer process undergoes, as well as the dependence of the activation energy of the process on the triplet energy difference of donor and acceptor molecules. This algorithm makes use of the complete potential-energy surfaces (singlet and triplet states), and contrasts with the first-order approximation already published [L. M. Frutos, O. Castano, J. L. Andres, M. Merchan, and A. U. Acuna, J. Chem. Phys. 120, 1208 (2004)] in which an expansion of the potential-energy surfaces was used. This algorithm is gradient based and finds the best trajectory for the acceptor molecule, starting from S(0) ground-state equilibrium geometry, to achieve the maximum variation of the singlet-triplet energy gap with the minimum energy of activation on S(0). Therefore, the algorithm allows the determination of a "reaction path" for the triplet-triplet energy-transfer processes. Also, the algorithm could also serve eventually to find minimum-energy crossing (singlet-triplet) points on the potential-energy surface, which can play an important role in the intersystem crossing process for the acceptor molecules to recover their initial capacity as acceptors. Also addressed is the misleading use of minimum-energy paths in T(1) to describe the energy-transfer process by comparing these results with those obtained using the new algorithm. The implementation of the algorithm is illustrated with different potential-energy surface models and it is discussed in the frame of nonvertical behavior.     

Paired-permanent approach for VB theory (II)

Paired-permanent approach for VB theory is extensively developed. Canonical expansion of a paired-permanent is deduced. Furthermore, it is shown that a paired-permanent may be expressed in terms of the products of sub-paired-permanents of any given order and their corresponding minors. Anab initio spin-free valence bond program, called Xiamen, is implemented by using paired-permanent approach. Test calculation shows that Xiamen package is more efficient than some other programs based on the traditional VB algorithm, and it provides a new practical tool for quantum chemistry.     

Discovery of network motifs based on induced subgraphs using a dynamic expansion tree

Biological networks are powerful representations of topological features in biological systems. Finding network motifs in biological networks is a computationally hard problem due to their huge size and abrupt increase of search space with the increase of motif size. Motivated by the computational challenges of network motif discovery and considering the importance of this topic, an efficient and scalable network motif discovery algorithm based on induced subgraphs in a dynamic expansion tree is proposed. This algorithm uses a pruning strategy to overcome the space limitation of the static expansion tree. The proposed algorithm can identify large network motifs up to size 15 by significantly reducing the computationally expensive subgraph isomorphism checks. Further, the present work avoids the unnecessary growth of patterns that do not have any statistical significance. The runtime performance of the proposed algorithm outperforms most of the existing algorithms for large network motifs.     

A space-saving modification of Davidson's eigenvector algorithm

A modification of Davidson's eigenvalue algorithm, based on the conjugate gradient method, is described. This method needs storage only for a few vectors (five to seven, depending on the implementation), making it practical for very large problems where disk storage is the limiting factor, without the necessity of restarting or discarding some expansion vectors. The convergence characteristics of the modified method are essentially identical with those of the original Davidson method if all expansion vectors are retained in the latter.     

On bound states in two-body systems

The application of the Σ-separation method to the calculation of multicenter two-electron molecular integrals with Slater-type basis functions is reported. The approach is based on the approximation of a scalar component of the two-center atomic density by a two-center expansion over Slater-type functions. A least-squares fit was used to determine the coefficients of the expansion. The angular multipliers of the atomic density were treated exactly. It is shown that this approach can serve as a sufficiently accurate and fast algorithm for the calculation of multicenter two-electron molecular integrals with Slater-type basis functions. © 1995 John Wiley & Sons, Inc.     

New recurrence relations for the rapid evaluation of electron repulsion integrals based on the accompanying coordinate expansion formula

We present an algorithm for the rapid computation of electron repulsion integrals (ERIs) over Gaussian basis functions based on the accompanying coordinate expansion (ACE) formula. The present algorithm uses equations termed angular momentum reduced expressions and introduces two types of recurrence relations to ACE formulas. Numerical efficiencies are assessed for (p pmid R:p p) and (sp spmid R:sp sp) ERIs by using the floating-point operation count. The algorithm is suitable for calculating ERIs for the same exponents but different angular momentum functions, such as L shells and derivatives of ERIs. The present algorithm is also capable of calculating ERIs with highly contracted Gaussian basis functions.     

Treating large intermediate spaces in the CIPSI method through a direct selected CI algorithm

Summary A general direct selected configuration interaction algorithm has been implemented and coupled to the second-order multireference many-body perturbation theory CIPSI algorithm. The new direct selected CI code is highly vectorizable and able to handle any list of determinants selected to describe a given electronic state of any spin multiplicity. In the present work selection of determinants has been carried out through the CIPSI algorithm but this is not a constraint of the direct selected CI code. The largest case treated so far involves a CI expansion containing 215 260 determinants selected from single and double excitations from 371 references. In this case there were 8 active electrons in 28 molecular orbitals for NH₃ in a DZP basis set. The direct selected CI calculation needs only 14 Mb of central storage (for the 215 260 determinants case) and takes 406 seconds per iteration on an IBM 3090/600J with vector facility.     

Fast computation,rotation, and comparison of low resolution spherical harmonic molecular surfaces

A procedure that rapidly generates an approximate parametric representation of macromolecular surface shapes is described. The parametrization is expressed as an expansion of real spherical harmonic basis functions. The advantage of using a parametric representation is that a pair of surfaces can be matched by using a quasi-Newton algorithm to minimize a suitably chosen objective function. Spherical harmonics are a natural and convenient choice of basis function when the task is one of search in a rotational search space. In particular, rotations of a molecular surface can be simulated by rotating only the harmonic expansion coefficients. This rotational property is applied for the first time to the 3-dimensional molecular similarity problem in which a pair of similar macromolecular surfaces are to be maximally superposed. The method is demonstrated with the superposition of antibody heavy chain variable domains. Special attention is given to computational efficiency. The spherical harmonic expansion coefficients are determined using fast surface sampling and integration schemes based on the tessellation of a regular icosahedron. Low resolution surfaces can be generated and displayed in under 10 s and a pair of surfaces can be maximally superposed in under 3 s on a contemporary workstation. ©1999 John Wiley & Sons, Inc. J Comput Chem 20: 383–395, 1999     

Lanczos cluster expansion for non-extensive systems

A cluster expansion of the Lanczos recursion for non-extensive systems is developed based on the plaquette expansion for extensive systems, in which an auxiliary scaling parameter, Ω, plays the role of volume and introduces extensivity into the problem. Connected Hamiltonian moments of the non-extensive system are computed and introduced into the plaquette expansion in the usual way with Ω. The extensive energy is calculated for increasing orders of the expansion in 1/Ω and the ground state and mass gap of the finite few body problem recovered in the limit Ω → ∞. This new non-perturbative method is applied to the case of N bosons interacting harmonically in one dimension and the ground state energy and mass gap in the vacuum sector are calculated exactly.     

All-forward semiclassical simulations of nonlinear response functions

We propose a quantum trajectory algorithm for computing nonlinear response functions of condensed phase molecular systems based on a time-ordered expansion of the density matrix. The nth-order response function is expressed as a sum of 2(n) impulsive response pathways representing trajectories involving zero, one, and up to n interactions with short external pulses. These are evaluated using a forward propagation algorithm based upon a Liouville space extension of the Bohmian propagation method.     

New analytic approximations based on the Magnus expansion

The Magnus expansion is a frequently used tool to get approximate analytic solutions of time-dependent linear ordinary differential equations and in particular the Schrödinger equation in quantum mechanics. However, the complexity of the expansion restricts its use in practice only to the first terms. Here we introduce new and more accurate analytic approximations based on the Magnus expansion involving only univariate integrals which also shares with the exact solution its main qualitative and geometric properties.     

Paired-permanent approach for VB theory (Ⅱ)——An ab initio spin-free VB program

Paired-permanent approach for VB theory is extensively developed. Canonical expansion of a paired-permanent is deduced. Furthermore, it is shown that a paired-permanent may be expressed in terms of the products of sub-paired-permanents of any given order and their corresponding minors. An ab initio spin-free valence bond program, called Xiamen, is implemented by using paired-permanent approach. Test calculation shows that Xiamen package is more efficient than some other programs based on the traditional VB algorithm, and it provides a new practical tool for quantum chemistry.     

High dimensional model representation constructed by support vector regression. I. Independent variables with known probability distributions

High dimensional model representation (HDMR) is a general set of quantitative model assessment and analysis tools for capturing high dimensional input-output system behavior. In practice, the HDMR component functions are each approximated by an appropriate basis function expansion. This procedure often requires many input-output samples which can restrict the treatment of high dimensional systems. In order to address this problem we introduce svr-based HDMR to efficiently and effectively construct the HDMR expansion by support vector regression (SVR) for a function \(f(\mathbf{x})\). In this paper the results for independent variables sampled over known probability distributions are reported. The theoretical foundation of the new approach relies on the kernel used in SVR itself being an HDMR expansion (referred to as the HDMR kernel ), i.e., an ANOVA kernel whose component kernels are mutually orthogonal and all non-constant component kernels have zero expectation. Several HDMR kernels are constructed as illustrations. While preserving the characteristic properties of HDMR, the svr-based HDMR method enables efficient construction of high dimensional models with satisfactory prediction accuracy from a modest number of samples, which also permits accurate computation of the sensitivity indices. A genetic algorithm is employed to optimally determine all the parameters of the component HDMR kernels and in SVR. The svr-based HDMR introduces a new route to advance HDMR algorithms. Two examples are used to illustrate the capability of the method.     

Efficient exact-exchange time-dependent density-functional theory methods and their relation to time-dependent Hartree-Fock

A recently introduced time-dependent exact-exchange (TDEXX) method, i.e., a response method based on time-dependent density-functional theory that treats the frequency-dependent exchange kernel exactly, is reformulated. In the reformulated version of the TDEXX method electronic excitation energies can be calculated by solving a linear generalized eigenvalue problem while in the original version of the TDEXX method a laborious frequency iteration is required in the calculation of each excitation energy. The lowest eigenvalues of the new TDEXX eigenvalue equation corresponding to the lowest excitation energies can be efficiently obtained by, e.g., a version of the Davidson algorithm appropriate for generalized eigenvalue problems. Alternatively, with the help of a series expansion of the new TDEXX eigenvalue equation, standard eigensolvers for large regular eigenvalue problems, e.g., the standard Davidson algorithm, can be used to efficiently calculate the lowest excitation energies. With the help of the series expansion as well, the relation between the TDEXX method and time-dependent Hartree-Fock is analyzed. Several ways to take into account correlation in addition to the exact treatment of exchange in the TDEXX method are discussed, e.g., a scaling of the Kohn-Sham eigenvalues, the inclusion of (semi)local approximate correlation potentials, or hybrids of the exact-exchange kernel with kernels within the adiabatic local density approximation. The lowest lying excitations of the molecules ethylene, acetaldehyde, and pyridine are considered as examples.     

Finite expansion of the inverse matrix in the polarization propagator method

 An alternative theoretical approach to the polarization propagator based on a new finite expansion of a finite-dimensional matrix is presented. The general equations for such an expansion are derived and the validity conditions stated. This method is used to accomplish an approximate scheme for the self-energy of the particle–hole propagator within the superoperator formalism. Within this scheme each contribution includes corrections to infinite order in electronic interaction and so describes collective effects in a natural way. Individual contributions can be interpreted as describing the propagation of the interaction through a particular subset of electronic excitations. Comparison with other known approximation levels, such as the random-phase approximation, is also analyzed. Received: 14 February 2000 / Accepted: 18 April 2000 / Published online: 18 August 2000     

Direct dynamics simulations using Hessian-based predictor-corrector integration algorithms

In previous research [J. Chem. Phys. 111, 3800 (1999)] a Hessian-based integration algorithm was derived for performing direct dynamics simulations. In the work presented here, improvements to this algorithm are described. The algorithm has a predictor step based on a local second-order Taylor expansion of the potential in Cartesian coordinates, within a trust radius, and a fifth-order correction to this predicted trajectory. The current algorithm determines the predicted trajectory in Cartesian coordinates, instead of the instantaneous normal mode coordinates used previously, to ensure angular momentum conservation. For the previous algorithm the corrected step was evaluated in rotated Cartesian coordinates. Since the local potential expanded in Cartesian coordinates is not invariant to rotation, the constants of motion are not necessarily conserved during the corrector step. An approximate correction to this shortcoming was made by projecting translation and rotation out of the rotated coordinates. For the current algorithm unrotated Cartesian coordinates are used for the corrected step to assure the constants of motion are conserved. An algorithm is proposed for updating the trust radius to enhance the accuracy and efficiency of the numerical integration. This modified Hessian-based integration algorithm, with its new components, has been implemented into the VENUS/NWChem software package and compared with the velocity-Verlet algorithm for the H(2)CO-->H(2)+CO, O(3)+C(3)H(6), and F(-)+CH(3)OOH chemical reactions.