scispace - formally typeset

Basis function

About: Basis function is a(n) research topic. Over the lifetime, 15615 publication(s) have been published within this topic receiving 405683 citation(s). The topic is also known as: blending function. more


Journal ArticleDOI: 10.1063/1.1677527
Abstract: Two extended basis sets (termed 5–31G and 6–31G) consisting of atomic orbitals expressed as fixed linear combinations of Gaussian functions are presented for the first row atoms carbon to fluorine. These basis functions are similar to the 4–31G set [J. Chem. Phys. 54, 724 (1971)] in that each valence shell is split into inner and outer parts described by three and one Gaussian function, respectively. Inner shells are represented by a single basis function taken as a sum of five (5–31G) or six (6–31G) Gaussians. Studies with a number of polyatomic molecules indicate a substantial lowering of calculated total energies over the 4–31G set. Calculated relative energies and equilibrium geometries do not appear to be altered significantly. more

Topics: STO-nG basis sets (67%), Molecular orbital theory (59%), Molecular orbital (58%) more

11,910 Citations

Open accessJournal ArticleDOI: 10.1088/0953-8984/14/11/302
José M. Soler1, Emilio Artacho2, Julian D. Gale3, Alberto García4  +4 moreInstitutions (6)
Abstract: We have developed and implemented a selfconsistent density functional method using standard norm-conserving pseudopotentials and a flexible, numerical linear combination of atomic orbitals basis set, which includes multiple-zeta and polarization orbitals. Exchange and correlation are treated with the local spin density or generalized gradient approximations. The basis functions and the electron density are projected on a real-space grid, in order to calculate the Hartree and exchange-correlation potentials and matrix elements, with a number of operations that scales linearly with the size of the system. We use a modified energy functional, whose minimization produces orthogonal wavefunctions and the same energy and density as the Kohn-Sham energy functional, without the need for an explicit orthogonalization. Additionally, using localized Wannier-like electron wavefunctions allows the computation time and memory required to minimize the energy to also scale linearly with the size of the system. Forces and stresses are also calculated efficiently and accurately, thus allowing structural relaxation and molecular dynamics simulations. more

Topics: Linear combination of atomic orbitals (63%), Hybrid functional (61%), Basis set (60%) more

7,811 Citations

Journal ArticleDOI: 10.1063/1.1674902
Abstract: An extended basis set of atomic functions expressed as fixed linear combinations of Gaussian functions is presented for hydrogen and the first‐row atoms carbon to fluorine. In this set, described as 4–31 G, each inner shell is represented by a single basis function taken as a sum of four Gaussians and each valence orbital is split into inner and outer parts described by three and one Gaussian function, respectively. The expansion coefficients and Gaussian exponents are determined by minimizing the total calculated energy of the atomic ground state. This basis set is then used in single‐determinant molecular‐orbital studies of a group of small polyatomic molecules. Optimization of valence‐shell scaling factors shows that considerable rescaling of atomic functions occurs in molecules, the largest effects being observed for hydrogen and carbon. However, the range of optimum scale factors for each atom is small enough to allow the selection of a standard molecular set. The use of this standard basis gives theoretical equilibrium geometries in reasonable agreement with experiment. more

Topics: STO-nG basis sets (64%), Basis set (59%), Molecular orbital (57%) more

7,677 Citations

Open accessJournal ArticleDOI: 10.1214/AOS/1176347963
Abstract: A new method is presented for flexible regression modeling of high dimensional data. The model takes the form of an expansion in product spline basis functions, where the number of basis functions as well as the parameters associated with each one (product degree and knot locations) are automatically determined by the data. This procedure is motivated by the recursive partitioning approach to regression and shares its attractive properties. Unlike recursive partitioning, however, this method produces continuous models with continuous derivatives. It has more power and flexibility to model relationships that are nearly additive or involve interactions in at most a few variables. In addition, the model can be represented in a form that separately identifies the additive contributions and those associated with the different multivariable interactions. more

6,289 Citations

Open accessJournal ArticleDOI: 10.1162/15324430152748236
Michael E. Tipping1Institutions (1)
Abstract: This paper introduces a general Bayesian framework for obtaining sparse solutions to regression and classification tasks utilising models linear in the parameters Although this framework is fully general, we illustrate our approach with a particular specialisation that we denote the 'relevance vector machine' (RVM), a model of identical functional form to the popular and state-of-the-art 'support vector machine' (SVM) We demonstrate that by exploiting a probabilistic Bayesian learning framework, we can derive accurate prediction models which typically utilise dramatically fewer basis functions than a comparable SVM while offering a number of additional advantages These include the benefits of probabilistic predictions, automatic estimation of 'nuisance' parameters, and the facility to utilise arbitrary basis functions (eg non-'Mercer' kernels) We detail the Bayesian framework and associated learning algorithm for the RVM, and give some illustrative examples of its application along with some comparative benchmarks We offer some explanation for the exceptional degree of sparsity obtained, and discuss and demonstrate some of the advantageous features, and potential extensions, of Bayesian relevance learning more

5,059 Citations

No. of papers in the topic in previous years

Top Attributes

Show by:

Topic's top 5 most impactful authors

Raj Mittra

145 papers, 2.6K citations

Eric T. Chung

126 papers, 1.9K citations

Yalchin Efendiev

84 papers, 2.8K citations

Giuseppe Vecchi

55 papers, 801 citations

Christophe Craeye

36 papers, 342 citations

Network Information
Related Topics (5)
Integral equation

41.6K papers, 768K citations

90% related

53K papers, 1M citations

89% related
Iterative method

48.8K papers, 1.2M citations

88% related
Numerical stability

16.6K papers, 476.3K citations

87% related
Numerical analysis

52.2K papers, 1.2M citations

87% related