相关论文: BFACF-style algorithms for polygons in the body-ce…
Solutions to a linear Diophantine system, or lattice points in a rational convex polytope, are important concepts in algebraic combinatorics and computational geometry. The enumeration problem is fundamental and has been well studied,…
We construct a three-dimensional Calderbank-Shor-Steane (CSS) stabilizer code on the Face-Centered Cubic (FCC) lattice. Physical qubits reside on the edges of the lattice (coordination $K=12$); X-stabilizers act on octahedral voids and…
Harmonic generalized barycentric coordinates (GBC) functions have been used for cartoon animation since an early work in 2006\cite{JMDGS06}. A computational procedure was further developed in \cite{SH15} for deformation between any two…
We present in this paper a rigorous theoretical framework to show stability, convergence and accuracy of improved edge-based and face-based smoothed finite element methods (bESFEM and bFS-FEM) for nearly-incompressible elasticity problems.…
We study quasi-Monte Carlo (QMC) methods for numerical integration of multivariate functions defined over the high-dimensional unit cube. Lattice rules and polynomial lattice rules, which are special classes of QMC methods, have been…
In this paper, we study the shortest $t$-dimensional hull embeddings of linear codes in both Euclidean and Hermitian cases, extending the existing research on the shortest LCD and self-orthogonal embeddings to arbitrary hull dimensions and…
We combine theory and experiments to explore the kinematics and actuation of intrinsically curved folds (ICFs) in otherwise developable shells. Unlike origami folds, ICFs are not bending isometries of flat sheets, but arise via…
We present a GPU-native mesh adaptation procedure that incorporates a complex geometry represented with a triangle mesh within a primary Cartesian computational grid organized as a forest of octrees. A C++/CUDA program implements the…
Protein structure prediction based on Hydrophobic-Polar energy model essentially becomes searching for a conformation having a compact hydrophobic core at the center. The hydrophobic core minimizes the interaction energy between the amino…
Lattice-linearity was introduced as a way to model problems using predicates that induce a lattice among the global states (Garg, SPAA 2020). A key property of \textit{the predicate} representing such problems is that it induces…
Body-Centred Cubic (BCC) lattices with twinned meta-crystal architecture inspired by the strengthening of bulk metals have significantly improved mechanical performance; however, their deformation behaviour and underlying strengthening…
The component-by-component (CBC) algorithm is a method for constructing good generating vectors for lattice rules for the efficient computation of high-dimensional integrals in the "weighted" function space setting introduced by Sloan and…
Line-graph (LG) lattices are known for having flat bands (FBs) from the destructive interference of Bloch wavefunctions encoded in pure lattice symmetry. Here, we develop a generic atomic/molecular orbital design principle for FBs in non-LG…
We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.
The quasicontinuum (QC) method, originally proposed by Tadmor, Ortiz and Phillips in 1996, is a computational technique that can efficiently handle regular atomistic lattices by combining continuum and atomistic approaches. In the present…
Meshless methods are often used in numerical simulations of systems of partial differential equations (PDEs), particularly those which involve complex geometries or free surfaces. Here we present a novel compact scheme based on the local…
Magnetic moments near zigzag edges in graphene allow complex nanostructures with customised spin properties to be realised. However, computational costs restrict theoretical investigations to small or perfectly periodic structures. Here we…
In this paper, a modified BFGS algorithm is proposed. The modified BFGS matrix estimates a modified Hessian matrix which is a convex combination of an identity matrix for the steepest descent algorithm and a Hessian matrix for the Newton…
We report on an ongoing project to parametrize the Fixed-Point Dirac operator for massless quarks, using a very general construction which has arbitrarily many fermion offsets and gauge paths, the complete Clifford algebra and satisfies all…
For Hermitian positive definite linear systems and eigenvalue problems, the eigCG algorithm is a memory efficient algorithm that solves the linear system and simultaneously computes some of its eigenvalues. The algorithm is based on the…