15,782 research outputs found
Several Problems Concerning Multivariate Functions and Associated Operators
This dissertation examines two distinct problems about multivariate functions and their associated operators. It first discusses the structure of Agler decompositions, which give useful ways to represent two-variable Schur functions on the bidisk using positive kernels. An elementary proof of the existence of Agler decompositions is provided, which uses special shift-invariant subspaces of the Hardy space. These shift-invariant subspaces are specific cases of Hilbert spaces that can be defined from Agler decompositions and their properties are analyzed. More specific results are obtained for certain classes of polynomials and rational inner functions.
Secondly, this dissertation examines differentiation of matrix-valued functions. Specifically, multivariate, real-valued functions induce matrix-valued functions defined on the space of d-tuples of n x n pairwise-commuting self-adjoint matrices. The geometry of this space of matrix tuples is characterized, and it is shown that the best notion of differentiation of these matrix-valued functions is differentiation along curves. The main result states that real-valued m-times continuously differentiable functions induce matrix-valued functions that can be m-times continuously differentiated along m-times continuously differentiable curves
Multivariate periodic wavelet analysis
AbstractGeneral multivariate periodic wavelets are an efficient tool for the approximation of multidimensional functions, which feature dominant directions of the periodicity.One-dimensional shift invariant spaces and tensor-product wavelets are generalized to multivariate shift invariant spaces on non-tensor-product patterns. In particular, the algebraic properties of the automorphism group are investigated. Possible patterns are classified. By divisibility considerations, decompositions of shift invariant spaces are given.The results are applied to construct multivariate orthogonal Dirichlet kernels and the respective wavelets. Furthermore a closure theorem is proven
A continuous analogue of the tensor-train decomposition
We develop new approximation algorithms and data structures for representing
and computing with multivariate functions using the functional tensor-train
(FT), a continuous extension of the tensor-train (TT) decomposition. The FT
represents functions using a tensor-train ansatz by replacing the
three-dimensional TT cores with univariate matrix-valued functions. The main
contribution of this paper is a framework to compute the FT that employs
adaptive approximations of univariate fibers, and that is not tied to any
tensorized discretization. The algorithm can be coupled with any univariate
linear or nonlinear approximation procedure. We demonstrate that this approach
can generate multivariate function approximations that are several orders of
magnitude more accurate, for the same cost, than those based on the
conventional approach of compressing the coefficient tensor of a tensor-product
basis. Our approach is in the spirit of other continuous computation packages
such as Chebfun, and yields an algorithm which requires the computation of
"continuous" matrix factorizations such as the LU and QR decompositions of
vector-valued functions. To support these developments, we describe continuous
versions of an approximate maximum-volume cross approximation algorithm and of
a rounding algorithm that re-approximates an FT by one of lower ranks. We
demonstrate that our technique improves accuracy and robustness, compared to TT
and quantics-TT approaches with fixed parameterizations, of high-dimensional
integration, differentiation, and approximation of functions with local
features such as discontinuities and other nonlinearities
A unified wavelet-based modelling framework for non-linear system identification: the WANARX model structure
A new unified modelling framework based on the superposition of additive submodels, functional components, and
wavelet decompositions is proposed for non-linear system identification. A non-linear model, which is often represented
using a multivariate non-linear function, is initially decomposed into a number of functional components via the wellknown
analysis of variance (ANOVA) expression, which can be viewed as a special form of the NARX (non-linear
autoregressive with exogenous inputs) model for representing dynamic input–output systems. By expanding each functional
component using wavelet decompositions including the regular lattice frame decomposition, wavelet series and
multiresolution wavelet decompositions, the multivariate non-linear model can then be converted into a linear-in-theparameters
problem, which can be solved using least-squares type methods. An efficient model structure determination
approach based upon a forward orthogonal least squares (OLS) algorithm, which involves a stepwise orthogonalization
of the regressors and a forward selection of the relevant model terms based on the error reduction ratio (ERR), is
employed to solve the linear-in-the-parameters problem in the present study. The new modelling structure is referred to
as a wavelet-based ANOVA decomposition of the NARX model or simply WANARX model, and can be applied to
represent high-order and high dimensional non-linear systems
Survey on counting special types of polynomials
Most integers are composite and most univariate polynomials over a finite
field are reducible. The Prime Number Theorem and a classical result of
Gau{\ss} count the remaining ones, approximately and exactly.
For polynomials in two or more variables, the situation changes dramatically.
Most multivariate polynomials are irreducible. This survey presents counting
results for some special classes of multivariate polynomials over a finite
field, namely the the reducible ones, the s-powerful ones (divisible by the
s-th power of a nonconstant polynomial), the relatively irreducible ones
(irreducible but reducible over an extension field), the decomposable ones, and
also for reducible space curves. These come as exact formulas and as
approximations with relative errors that essentially decrease exponentially in
the input size.
Furthermore, a univariate polynomial f is decomposable if f = g o h for some
nonlinear polynomials g and h. It is intuitively clear that the decomposable
polynomials form a small minority among all polynomials. The tame case, where
the characteristic p of Fq does not divide n = deg f, is fairly
well-understood, and we obtain closely matching upper and lower bounds on the
number of decomposable polynomials. In the wild case, where p does divide n,
the bounds are less satisfactory, in particular when p is the smallest prime
divisor of n and divides n exactly twice. The crux of the matter is to count
the number of collisions, where essentially different (g, h) yield the same f.
We present a classification of all collisions at degree n = p^2 which yields an
exact count of those decomposable polynomials.Comment: to appear in Jaime Gutierrez, Josef Schicho & Martin Weimann
(editors), Computer Algebra and Polynomials, Lecture Notes in Computer
Scienc
- …