Results 21 to 30 of about 62 (61)

Fast Spectral Projection Algorithms for Density-Matrix Computations

, 1998
We present a fast algorithm for the construction of a spectral projector. This algorithm allows us to compute the density matrix, as used in e.g the Kohn-Sham iteration, and so obtain the electron density.
Nicholas Coult, Martin J. Mohlenkamp, Gregory Beylkin   +2 more
core  

Dynamics of a multiplex neural network with delayed couplings. [PDF]

Appl Math Mech, 2021
Mao X, Li X, Ding W, Wang S, Zhou X, Qiao L.   +5 more
europepmc   +1 more source

A New Global Optimization Algorithm

, 1996
. We present a new global optimization method and one of its applications to an eigenvalue problem. We will prove the convergence of this algorithm. This algorithm is based on automatic differentiation and the higher order derivative method. It consists
C. Massat, M. Masmoudi
core  

On the computation of recurrence coefficients for univariate orthogonal polynomials. [PDF]

J Sci Comput, 2021
Liu Z, Narayan A.
europepmc   +1 more source

Construction of compactly supported biorthogonal wavelets in L₂(R^s)

, 1997
: This paper presents a general construction of compactly supported biorthogonal wavelets in L 2 (IR s ). In particular, a concrete method for the construction of bivariate compactly supported biorthogonal wavelets of increasing smoothness is provided.
Sherman D. Riemenschneider, Zuowei Shen
core  

Learning via variably scaled kernels. [PDF]

Adv Comput Math, 2021
Campi C, Marchetti F, Perracchione E.
europepmc   +1 more source

Multidimensional Interpolatory Subdivision Schemes

, 1996
. This paper presents a general construction of multidimensional interpolatory subdivision schemes. In particular, we provide a concrete method for the construction of bivariate interpolatory subdivision schemes of increasing smoothness by finding an ...
Sherman D. Riemenschneider, Zuowei Shen
core  

HILBERT-SPACE TECHNIQUES FOR SPECTRAL REPRESENTATION IN TERMS OF OVERCOMPLETE BASES

, 2007
Topics associated with the representation of objects from a separable Hilbert space in terms of an a priori given overcomplete system (dictionary) of its generators (atoms) are handled. First the procedure of nding such a representation is formulated and
Vtzslav Vesel
core  

LEARNING TO PREDICT PHYSICAL PROPERTIES USING SUMS OF SEPARABLE FUNCTIONS∗

, 2011
. We present an algorithm for learning the function that maps a material structure to its value on some property, given the value of this function on several structures.
Alex, Ryan Botts, Martin J. Mohlenkamp
core  

A new line search technique

, 2004
In this paper the problem of line search, an important step in most multidimensional optimization algorithms, is considered.If conjugate gradient descent is to be used in producing a descent sequence for a given functional f on a Hilbert space H, then at
Adewale, TA, Aderibigbe, FM
core