Amos Ron
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Amos Ron has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
Zuowei Shen
Computer Sciences Department, University of Wisconsin-Madison, 1210 West Dayton, Madison, WI 53706, USA
6 shared publicationsCarl De Boor
4 shared publications- Ronald DeVore
Texas A&M University
3 shared publications Carl DE Boor
2 shared publications- Zhiqiang Xu
State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China
2 shared publications - Albert Cohen1 shared publication
Latest Publications
- Open Access
Complete graphs: the space of simplicial cones, and their path tree representation
Let $G$ be a complete graph with $n+1$ vertices. In a recent paper of the authors, it is shown that the path trees of the graph play a special role in the structure of the truncated powers and partition functions that are associated with the graph. Motivated by the above, we take here a closer look at the geometry of the simplicial cones associated with the graph, and the role played by those simplicial cones that are generated by path trees. It is shown that the latter form a basis for the linear space spanned by the former, and that the representation of a general simplicial cone by path tree cones can be deduced by examining partial orders induced by rooted trees. While the problem itself is geometrical and its solution is combinatorial, the proofs rest with multivariate spline theory.Open AccessComplete graphs: the space of simplicial cones, and their path tree representation
Let $G$ be a complete graph with $n+1$ vertices. In a recent paper of the authors, it is shown that the path trees of the graph play a special role in the structure of the truncated powers and partition functions that are associated with the graph. Motivated by the above, we take here a closer look at the geometry of the simplicial cones associated with the graph, and the role played by those simplicial cones that are generated by path trees. It is shown that the latter form a basis for the linear space spanned by the former, and that the representation of a general simplicial cone by path tree cones can be deduced by examining partial orders induced by rooted trees. While the problem itself is geometrical and its solution is combinatorial, the proofs rest with multivariate spline theory. - Open Access
- 1 February 2012
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 364 (2) , 745-766
Hierarchical zonotopal spaces
Zonotopal algebra interweaves algebraic, geometric and combinatorial properties of a given linear map . Of basic significance in this theory is the fact that the algebraic structures are derived from the geometry (via a nonlinear procedure known as ``the least map''), and that the statistics of the algebraic structures (e.g., the Hilbert series of various polynomial ideals) are combinatorial, i.e., computable using a simple discrete algorithm known as ``the valuation function''. On the other hand, the theory is somewhat rigid since it deals, for the given , with exactly two pairs, each of which consists of a nested sequence of three ideals: an external ideal (the smallest), a central ideal (the middle), and an internal ideal (the largest).
- 1 February 2012
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 364 (2) , 745-766
Open AccessHierarchical zonotopal spaces
Zonotopal algebra interweaves algebraic, geometric and combinatorial properties of a given linear map . Of basic significance in this theory is the fact that the algebraic structures are derived from the geometry (via a nonlinear procedure known as ``the least map''), and that the statistics of the algebraic structures (e.g., the Hilbert series of various polynomial ideals) are combinatorial, i.e., computable using a simple discrete algorithm known as ``the valuation function''. On the other hand, the theory is somewhat rigid since it deals, for the given , with exactly two pairs, each of which consists of a nested sequence of three ideals: an external ideal (the smallest), a central ideal (the middle), and an internal ideal (the largest).
- Open Access
- 1 December 2010
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 362 (12) , 6205
Approximation using scattered shifts of a multivariate function
The approximation of a general -variate function by the shifts <!-- MATH $\phi(\cdot-\xi)$ --> , <!-- MATH $\xi\in\Xi\subset \mathbb{R}^d$ --> , of a fixed function occurs in many applications such as data fitting, neural networks, and learning theory. When <!-- MATH $\Xi=h\mathbb{Z}^d$ --> is a dilate of the integer lattice, there is a rather complete understanding of the approximation problem using Fourier techniques. However, in most applications, the center set is either given, or can be chosen with complete freedom. In both of these cases, the shift-invariant setting is too restrictive. This paper studies the approximation problem in the case that is arbitrary. It establishes approximation theorems whose error bounds reflect the local density of the points in . Two different settings are analyzed. The first occurs when the set is prescribed in advance. In this case, the theorems of this paper show that, in analogy with the classical univariate spline approximation, an improved approximation occurs in regions where the density is high. The second setting corresponds to the problem of nonlinear approximation. In that setting the set can be chosen using information about the target function . We discuss how to `best' make these choices and give estimates for the approximation error.- 1 December 2010
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 362 (12) , 6205
Open AccessApproximation using scattered shifts of a multivariate function
The approximation of a general -variate function by the shifts <!-- MATH $\phi(\cdot-\xi)$ --> , <!-- MATH $\xi\in\Xi\subset \mathbb{R}^d$ --> , of a fixed function occurs in many applications such as data fitting, neural networks, and learning theory. When <!-- MATH $\Xi=h\mathbb{Z}^d$ --> is a dilate of the integer lattice, there is a rather complete understanding of the approximation problem using Fourier techniques. However, in most applications, the center set is either given, or can be chosen with complete freedom. In both of these cases, the shift-invariant setting is too restrictive. This paper studies the approximation problem in the case that is arbitrary. It establishes approximation theorems whose error bounds reflect the local density of the points in . Two different settings are analyzed. The first occurs when the set is prescribed in advance. In this case, the theorems of this paper show that, in analogy with the classical univariate spline approximation, an improved approximation occurs in regions where the density is high. The second setting corresponds to the problem of nonlinear approximation. In that setting the set can be chosen using information about the target function . We discuss how to `best' make these choices and give estimates for the approximation error. - Open Access
Hierarchical zonotopal spaces
Zonotopal algebra interweaves algebraic, geometric and combinatorial properties of a given linear map X. Of basic significance in this theory is the fact that the algebraic structures are derived from the geometry (via a non-linear procedure known as "the least map"), and that the statistics of the algebraic structures (e.g., the Hilbert series of various polynomial ideals) are combinatorial, i.e., computable using a simple discrete algorithm known as "the valuation function". On the other hand, the theory is somewhat rigid since it deals, for the given X, with exactly two pairs each of which is made of a nested sequence of three ideals: an external ideal (the smallest), a central ideal (the middle), and an internal ideal (the largest). In this paper we show that the fundamental principles of zonotopal algebra as described in the previous paragraph extend far beyond the setup of external, central and internal ideals by building a whole hierarchy of new combinatorially defined zonotopal spaces.
Open AccessHierarchical zonotopal spaces
Zonotopal algebra interweaves algebraic, geometric and combinatorial properties of a given linear map X. Of basic significance in this theory is the fact that the algebraic structures are derived from the geometry (via a non-linear procedure known as "the least map"), and that the statistics of the algebraic structures (e.g., the Hilbert series of various polynomial ideals) are combinatorial, i.e., computable using a simple discrete algorithm known as "the valuation function". On the other hand, the theory is somewhat rigid since it deals, for the given X, with exactly two pairs each of which is made of a nested sequence of three ideals: an external ideal (the smallest), a central ideal (the middle), and an internal ideal (the largest). In this paper we show that the fundamental principles of zonotopal algebra as described in the previous paragraph extend far beyond the setup of external, central and internal ideals by building a whole hierarchy of new combinatorially defined zonotopal spaces.
- Open Access
Approximation using scattered shifts of a multivariate function
The approximation of a general $d$-variate function $f$ by the shifts $\phi(\cdot-\xi)$, $\xi\in\Xi\subset \Rd$, of a fixed function $\phi$ occurs in many applications such as data fitting, neural networks, and learning theory. When $\Xi=h\Z^d$ is a dilate of the integer lattice, there is a rather complete understanding of the approximation problem \cite{BDR,Johnson1} using Fourier techniques. However, in most applications the {\it center} set $\Xi$ is either given, or can be chosen with complete freedom. In both of these cases, the shift-invariant setting is too restrictive. This paper studies the approximation problem in the case $\Xi$ is arbitrary. It establishes approximation theorems whose error bounds reflect the local density of the points in $\Xi$. Two different settings are analyzed. The first is when the set $\Xi$ is prescribed in advance. In this case, the theorems of this paper show that, in analogy with the classical univariate spline approximation, improved approximation occurs in regions where the density is high. The second setting corresponds to the problem of non-linear approximation. In that setting the set $\Xi$ can be chosen using information about the target function $f$. We discuss how to `best' make these choices and give estimates for the approximation error.Open AccessApproximation using scattered shifts of a multivariate function
The approximation of a general $d$-variate function $f$ by the shifts $\phi(\cdot-\xi)$, $\xi\in\Xi\subset \Rd$, of a fixed function $\phi$ occurs in many applications such as data fitting, neural networks, and learning theory. When $\Xi=h\Z^d$ is a dilate of the integer lattice, there is a rather complete understanding of the approximation problem \cite{BDR,Johnson1} using Fourier techniques. However, in most applications the {\it center} set $\Xi$ is either given, or can be chosen with complete freedom. In both of these cases, the shift-invariant setting is too restrictive. This paper studies the approximation problem in the case $\Xi$ is arbitrary. It establishes approximation theorems whose error bounds reflect the local density of the points in $\Xi$. Two different settings are analyzed. The first is when the set $\Xi$ is prescribed in advance. In this case, the theorems of this paper show that, in analogy with the classical univariate spline approximation, improved approximation occurs in regions where the density is high. The second setting corresponds to the problem of non-linear approximation. In that setting the set $\Xi$ can be chosen using information about the target function $f$. We discuss how to `best' make these choices and give estimates for the approximation error. - 31 January 2008
- Published by Elsevier in Journal of Approximation Theory
- Vol. 150 (1) , 1-23
Box splines revisited: Convergence and acceleration methods for the subdivision and the cascade algorithms
- 31 January 2008
- Published by Elsevier in Journal of Approximation Theory
- Vol. 150 (1) , 1-23
Box splines revisited: Convergence and acceleration methods for the subdivision and the cascade algorithms
- 31 January 2008
- Published by Springer Nature in Constructive Approximation
- Vol. 29 (3) , 303-323
Time Frequency Representations of Almost Periodic Functions
- 31 January 2008
- Published by Springer Nature in Constructive Approximation
- Vol. 29 (3) , 303-323
Time Frequency Representations of Almost Periodic Functions
- 8 October 2004
- Published by Springer Nature in Constructive Approximation
- Vol. 22 (1) , 1-45
Generalized Shift-Invariant Systems
- 8 October 2004
- Published by Springer Nature in Constructive Approximation
- Vol. 22 (1) , 1-45
Generalized Shift-Invariant Systems
- 1 January 2001
- Published by Springer Nature in Numerische Mathematik
- Vol. 87 (3) , 555-595
A new factorization technique of the matrix mask of univariate refinable functions
- 1 January 2001
- Published by Springer Nature in Numerische Mathematik
- Vol. 87 (3) , 555-595
A new factorization technique of the matrix mask of univariate refinable functions
- Open Access
- 1 January 1998
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 67 (221) , 191-207
Compactly supported tight affine spline frames in 𝐿₂(ℝ^{𝕕})
The theory of fiberization is applied to yield compactly supported tight affine frames (wavelets) in L 2 ( R d ) L_{2}(\mathbb {R}^{d}) from box splines. The wavelets obtained are smooth piecewise-polynomials on a simple mesh; furthermore, they exhibit a wealth of symmetries, and have a relatively small support. The number of “mother wavelets”, however, increases with the increase of the required smoothness. Two bivariate constructions, of potential practical value, are highlighted. In both, the wavelets are derived from four-direction mesh box splines that are refinable with respect to the dilation matrix ( 1 a m p ; 1 1 a m p ; − 1 ) \begin {pmatrix}1&1\ 1&-1\end {pmatrix} .
- 1 January 1998
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 67 (221) , 191-207
Open AccessCompactly supported tight affine spline frames in 𝐿₂(ℝ^{𝕕})
The theory of fiberization is applied to yield compactly supported tight affine frames (wavelets) in L 2 ( R d ) L_{2}(\mathbb {R}^{d}) from box splines. The wavelets obtained are smooth piecewise-polynomials on a simple mesh; furthermore, they exhibit a wealth of symmetries, and have a relatively small support. The number of “mother wavelets”, however, increases with the increase of the required smoothness. Two bivariate constructions, of potential practical value, are highlighted. In both, the wavelets are derived from four-direction mesh box splines that are refinable with respect to the dilation matrix ( 1 a m p ; 1 1 a m p ; − 1 ) \begin {pmatrix}1&1\ 1&-1\end {pmatrix} .