A Hybrid Alternating Least Squares--TT-Cross Algorithm for Parametric PDEs
نویسندگان
چکیده
منابع مشابه
An Alternating Least Squares Algorithm with Application to Image Processing
Least Squares (LS) estimation is a classical problem, often arising in practice. When the dimension of the problem is large, the solution may be difficult to obtain, due to complexity reasons. A general way to reduce the complexity is that of breaking the problem in smaller sub-problems. Following this approach, in the paper we introduce an Alternating Least Squares (ALS) algorithm that finds t...
متن کاملThe least squares algorithm, parametric system identification and bounded noise
Al~trad-The least squares parametric system identification algorithm is analyzed assuming that the noise is a bounded signal. A bound on the worst-case parameter estimation error is derived. This bound shows that the worst-case parameter estimation error decreases to zero as the bound on the noise is decreased to zero. 1. Introduction THE LEAST SQUARES ALGORITHM, due to Gauss, is one of the mos...
متن کاملA Fast Hierarchical Alternating Least Squares Algorithm for Orthogonal Nonnegative Matrix Factorization
Nonnegative Matrix Factorization (NMF) is a popular technique in a variety of fields due to its component-based representation with physical interpretablity. NMF finds a nonnegative hidden structures as oblique bases and coefficients. Recently, Orthogonal NMF (ONMF), imposing an orthogonal constraint into NMF, has been gathering a great deal of attention. ONMF is more appropriate for the cluste...
متن کاملDiscrete least squares polynomial approximation with random evaluations – application to parametric and stochastic elliptic PDES
Motivated by the numerical treatment of parametric and stochastic PDEs, we analyze the least-squares method for polynomial approximation of multivariate functions based on random sampling according to a given probability measure. Recent work has shown that in the univariate case, the least-squares method is quasi-optimal in expectation in [8] and in probability in [20], under suitable condition...
متن کاملApproximate Moving Least-Squares Approximation for Time-Dependent PDEs
For multivariate problems with many scattered data locations the use of radial functions has proven to be advantageous. However, using the usual radial basis function approach one needs to solve a large (possibly dense) linear system. In the moving least squares (MLS) method one obtains a best approximation of the given data in a (moving) weighted least-squares sense. The computational burden i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM/ASA Journal on Uncertainty Quantification
سال: 2019
ISSN: 2166-2525
DOI: 10.1137/17m1138881