相关论文: 3DEX: a code for fast spherical Fourier-Bessel dec…
We introduce an efficient decoder of the color code in $d\geq 2$ dimensions, the Restriction Decoder, which uses any $d$-dimensional toric code decoder combined with a local lifting procedure to find a recovery operation. We prove that the…
This paper introduces an extended tensor decomposition (XTD) method for model reduction. The proposed method is based on a sparse non-separated enrichment to the conventional tensor decomposition, which is expected to improve the…
We discuss in some details a novel algorithm for performing partial-sky spherical harmonic transforms (SHT), building on the Fourier-sphere method of Reinecke et al (2023) handling efficiently high numbers of arbitrary locations on the…
The surface code is one of the most promising candidates for combating errors in large scale fault-tolerant quantum computation. A fault-tolerant decoder is a vital part of the error correction process---it is the algorithm which computes…
Wide-baseline panoramic images are frequently used in applications like VR and simulations to minimize capturing labor costs and storage needs. However, synthesizing novel views from these panoramic images in real time remains a significant…
We have developed a new three-dimensional algorithm, based on the standard P$^3$M method, for computing deflections due to weak gravitational lensing. We compare the results of this method with those of the two-dimensional planar approach,…
Based on the Beylkin-Cramer summation rule, we introduce a new fast algorithm that enable us to explore the high order statistics efficiently in large data sets. Central to this technique is to make decomposition both of fields and…
Deformable fractured porous media appear in many geoscience applications. While the extended finite element (XFEM) has been successfully developed within the computational mechanics community for accurate modeling of the deformation, its…
Fourier-Legendre decomposition (FLD) of solar Doppler imaging data is a promising method to estimate the sub-surface solar meridional flow. FLD is sensible to low-degree oscillation modes and thus has the potential to probe the deep…
We present an efficient, trivially parallelizable algorithm to compute offset surfaces of shapes discretized using a dexel data structure. Our algorithm is based on a two-stage sweeping procedure that is simple to implement and efficient,…
An efficient decoding algorithm named `divided decoder' is proposed in this paper. Divided decoding can be combined with any decoder using QR-decomposition and offers different pairs of performance and complexity. Divided decoding provides…
Dynamic mode decomposition (DMD) has become a powerful data-driven method for analyzing the spatiotemporal dynamics of complex, high-dimensional systems. However, conventional DMD methods are limited to matrix-based formulations, which…
This work presents a polyhedral scaled boundary finite element method (PSBFEM) for three dimensional seepage analysis. We first derive the scaled boundary formulation for 3D seepage problems, and subsequently incorporate Wachspress shape…
Most of the calculations in standard sphere decoders are redundant, in the sense that they either calculate quantities that are never used or calculate some quantities more than once. A new method, which is applicable to lattices as well as…
In computed tomography, the approximation quality of a scan of a physical object is typically limited by the acquisition modalities, especially the hardware including X-ray detectors. To improve upon this, we experiment with a…
Recent advances in computer graphics and computer vision have found successful application of deep neural network models for 3D shapes based on signed distance functions (SDFs) that are useful for shape representation, retrieval, and…
Unsupervised image registration commonly adopts U-Net style networks to predict dense displacement fields in the full-resolution spatial domain. For high-resolution volumetric image data, this process is however resource-intensive and…
Obtaining constraints from the largest scales of a galaxy survey is challenging due to the survey mask allowing only partial measurement of large angular modes. This scatters information from the harmonic-space 2-point function away from…
We introduce a fast and invertible approximation for data simulated as 2D planar meshes with connectivities along the poloidal dimension in deforming 3D toroidal (donut-like) spaces generated by fusion simulations. In fusion simulations,…
We present in this paper a spectrally accurate numerical method for computing the spherical/vector spherical harmonic expansion of a function/vector field with given (elemental) nodal values on a spherical surface. Built upon suitable…