Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

A novel recursive method to reconstruct multivariate functions on the unit cube

View through CrossRef
AbstractDue to discontinuity on the boundary, traditional Fourier approximation does not work efficiently ford−variate functions on [0, 1]d. In this paper, we will give a recursive method to reconstruct/approximate functions on [0, 1]dwell. The main process is as follows: We reconstruct ad−variate function by using all of its (d−1)–variate boundary functions and fewd–variate Fourier coefficients. We reconstruct each (d−1)–variate boundary function given in the preceding reconstruction by using all of its (d−2)–variate boundary functions and few (d−1)–variate Fourier coefficients. Continuing this procedure, we finally reconstruct each univariate boundary function in the preceding reconstruction by using values of the function at two ends and few univariate Fourier coefficients. Our recursive method can reconstruct multivariate functions on the unit cube with much smaller error than traditional Fourier methods.
Walter de Gruyter GmbH
Title: A novel recursive method to reconstruct multivariate functions on the unit cube
Description:
AbstractDue to discontinuity on the boundary, traditional Fourier approximation does not work efficiently ford−variate functions on [0, 1]d.
In this paper, we will give a recursive method to reconstruct/approximate functions on [0, 1]dwell.
The main process is as follows: We reconstruct ad−variate function by using all of its (d−1)–variate boundary functions and fewd–variate Fourier coefficients.
We reconstruct each (d−1)–variate boundary function given in the preceding reconstruction by using all of its (d−2)–variate boundary functions and few (d−1)–variate Fourier coefficients.
Continuing this procedure, we finally reconstruct each univariate boundary function in the preceding reconstruction by using values of the function at two ends and few univariate Fourier coefficients.
Our recursive method can reconstruct multivariate functions on the unit cube with much smaller error than traditional Fourier methods.

Related Results

Pengaruh Terapi Ice Cube untuk Mengurangi Haus Pada Pasien Gagal Ginjal Kronik yang Menjalani Hemodialisa di RSU Royal Prima Medan
Pengaruh Terapi Ice Cube untuk Mengurangi Haus Pada Pasien Gagal Ginjal Kronik yang Menjalani Hemodialisa di RSU Royal Prima Medan
ABSTRACT Kidney failure is a condition where the functioning of the kidneys decreases suddenly. This occurs when the kidneys are unable to release substances into body fluids that ...
Abstract P4-01-06: Evaluation of 3D T2-weighted Breast MRI
Abstract P4-01-06: Evaluation of 3D T2-weighted Breast MRI
Abstract Background: Although the dynamic contrast enhanced (DCE) sequence has long been considered the most important sequence to characterize benign and malignant ...
Is Recursive “Mindreading” Really an Exception to Limitations on Recursive Thinking
Is Recursive “Mindreading” Really an Exception to Limitations on Recursive Thinking
The ability to mindread recursively – for example by thinking what person 1 thinks person 2 thinks person 3 thinks – is a prime example of recursive thinking in which one process, ...
Reconstruction d'images pour un imageur hyperspectral configurable
Reconstruction d'images pour un imageur hyperspectral configurable
Une image hyperspectrale (HS) d'une scène correspond à un cube de données avec deux dimensions spatiales et une dimension spectrale : elle peut être vue comme un grand nombre d'ima...
Recursive Informational Curvature: A Unified Geometric Meta-Framework for Consciousness
Recursive Informational Curvature: A Unified Geometric Meta-Framework for Consciousness
We introduce Recursive Informational Curvature (RIC), a unified geometric meta-framework in which consciousness arises from the recursive self-modulation of symbolic informational ...
k-super cube root cube mean labeling of graphs
k-super cube root cube mean labeling of graphs
Consider a graph G with |V (G)| = p and |E(G)| = q and let f : V (G) → {k, k + 1, k + 2, . . . p + q + k − 1}} be an injective function. The induced edge labeling f ∗ for a vertex ...
The data cube system to EO datasets: the DCS4COP project
The data cube system to EO datasets: the DCS4COP project
<p>Earth Observation (EO) data availability is drastically increasing thanks to the Copernicus Sentinel missions. In 2014 Sentinel data volumes were approximately 200...
The Cube: Its Relatives, Geodesics, Billiards, and Generalisations
The Cube: Its Relatives, Geodesics, Billiards, and Generalisations
Starting with a cube and its symmetry group one can get related polyhedrons via corner and edge trimming and dualizing processes or via adding congruent polyhedrons to its faces. T...

Back to Top