Results 21 to 30 of about 52 (52)
Basc: Constrained Approximation by Semidefinite Programming
This article details the theoretical grounds for a semidefinite-programming-based method that computes best approximants by splines under some general constraints and relative to several function norms, notably the max-norm.
Vladlena Powers, Simon Foucart
core
Fast Spectral Projection Algorithms for Density-Matrix Computations
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 +2 more
core
: 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
A New Global Optimization Algorithm
. 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
Multidimensional Interpolatory Subdivision Schemes
. 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
Construction of compactly supported biorthogonal wavelets in L<sub>2</sub>(R<sup>s</sup>)
: 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
HILBERT-SPACE TECHNIQUES FOR SPECTRAL REPRESENTATION IN TERMS OF OVERCOMPLETE BASES
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∗
. 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
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
Multidimensional Interpolatory Subdivision Schemes
: 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

