A preconditioned fast collocation method for a linear bond-based peridynamic model
We develop a fast collocation method for a static bond-based peridynamic model. Based on the analysis of the structure of the stiffness matrix, a fast matrix-vector multiplication technique was found, which can be used in the Krylov subspace iteration ...
Xuhao Zhang +3 more
doaj +1 more source
An Efficient Block Circulant Preconditioner For Simulating Fracture Using Large Fuse Networks
{\it Critical slowing down} associated with the iterative solvers close to the critical point often hinders large-scale numerical simulation of fracture using discrete lattice networks.
Batrouni G G +15 more
core +1 more source
UTILIZING CONCEPTUAL MODELING IN THE STUDY OF ONE OF THE IRANIAN FRACTURED CARBONATE RESERVOIRS [PDF]
A typical Iranian carbonate matrix block surrounded by an open fracture was modeled in order to understand the fracture-matrix interaction and realize how to model the interaction best. The modeling was carried out by using a fine-scaled Eclipse model in
seyed Majid Hashemi, Gholamreza Bashiri
doaj +1 more source
Optical solitary wave solutions in generalized determinant form for Kundu–Eckhaus equation
The Kundu–Eckhaus (KE) equation describes the propagation of ultra-short femtosecond pulses in optical fibers. In this paper, on the basis of Hirota bilinear form of KE equation, a complex matrix is introduced into the differential relation satisfied by ...
Gui-Min Yue, Xiang-Hua Meng
doaj +1 more source
Random Block Matrices and Matrix Orthogonal Polynomials [PDF]
In this paper we consider random block matrices, which generalize the general beta ensembles, which were recently investigated by Dumitriu and Edelmann (2002, 2005). We demonstrate that the eigenvalues of these random matrices can be uniformly approximated by roots of matrix orthogonal polynomials which were investigated independently from the random ...
Dette, Holger, Reuther, Bettina
openaire +3 more sources
Very Large-Scale Singular Value Decomposition Using Tensor Train Networks [PDF]
We propose new algorithms for singular value decomposition (SVD) of very large-scale matrices based on a low-rank tensor approximation technique called the tensor train (TT) format. The proposed algorithms can compute several dominant singular values and
Cichocki, Andrzej, Lee, Namgil
core +1 more source
Walsh–Hadamard Kernel Feature-Based Image Compression Using DCT with Bi-Level Quantization
To meet the high bit rate requirements in many multimedia applications, a lossy image compression algorithm based on Walsh–Hadamard kernel-based feature extraction, discrete cosine transform (DCT), and bi-level quantization is proposed in this paper. The
Dibyalekha Nayak +3 more
doaj +1 more source
Block ILU factorization preconditioners for a block-tridiagonal H-matrix
The authors propose three new block incomplete LU (BILU) factorizations for a block-tridiagonal \(H\)-matrix readily parallelizable. The construction of BILU factors is based on the element-wise LU \(\text{ILU}(k)\) factorization (incomplete LU factorization of level \(k\) of fill-in) of diagonal blocks, \(B_i=L_iU_i-R_i\).
Kim, Sang Wook, Yun, Jae Heon
openaire +2 more sources
Block Spin Density Matrix of the Inhomogeneous AKLT Model
We study the inhomogeneous generalization of a 1-dimensional AKLT spin chain model. Spins at each lattice site could be different. Under certain conditions, the ground state of this AKLT model is unique and is described by the Valence-Bond-Solid (VBS ...
A. Affleck +56 more
core +2 more sources
Hybrid variation-perturbation method for calculating rovibrational energy levels of polyatomic molecules [PDF]
A procedure for calculation of rotation-vibration states of medium sized molecules is presented. It combines the advantages of variational calculations and perturbation theory.
Pavlyuchko, A. I. +2 more
core +1 more source

