نتایج جستجو برای: elementary block matrix operations
تعداد نتایج: 687288 فیلتر نتایج به سال:
Cryptompress, a new 128-bit (initial) private-key cryptography algorithm is proposed. It uses a block size of at least 30 bits and increments prior key size to additional 32 bits on each unsuccessful attempt of any means, including bruteforcing, further changing a specific portion of the cyphertext using the reformed Feistel network. Encryption process results from a proposed compression sequen...
This paper considers how to construct and describe matrix equalities that are composed of algebraic operations matrices their generalized inverses. We select a group known new reverse-order laws for inverses several products derive various necessary sufficient conditions them hold using the rank method block method.
LU, QR, and Cholesky factorizations are the most widely used methods for solving dense linear systems of equations, and have been extensively studied and implemented on vector and parallel computers. Most of these factorization routines are implemented with blockpartitioned algorithms in order to perform matrix-matrix operations, that is, to obtain the highest performance by maximizing reuse of...
in this paper, we find matrix representation of a class of sixth order sturm-liouville problem (slp) with separated, self-adjoint boundary conditions and we show that such slp have finite spectrum. also for a given matrix eigenvalue problem $hx=lambda vx$, where $h$ is a block tridiagonal matrix and $v$ is a block diagonal matrix, we find a sixth order boundary value problem of atkin...
It has been recently proved that a variety of associative PI-superalgebras with graded involution finite basic rank over field characteristic zero is minimal fixed ⁎-graded exponent if, and only it generated by subalgebra an upper block triangular matrix algebra, A:=UTZ2⁎(A1,…,Am), equipped suitable elementary Z2-grading involution. Here we give necessary sufficient conditions so IdZ2⁎(A) facto...
Leveraging optimization techniques (e.g., register blocking and double buffering) introduced in the context of KBLAS, a Level 2 BLAS high performance library on GPUs, the authors implement dense matrix-vector multiplications within a sparse-block structure. While these optimizations are important for high performance dense kernel executions, they are even more critical when dealing with sparse ...
A quantum compiler is a software program for decomposing (“compiling”) an arbitrary unitary matrix into a sequence of elementary operations (SEO). The author of this paper is also the author of a quantum compiler called Qubiter. Qubiter uses a matrix decomposition called the Cosine-Sine Decomposition (CSD) that is well known in the field of Computational Linear Algebra. One way of measuring the...
Ill-conditioned matrices with block Toeplitz, Toeplitz block (BTTB) structure arise from the discretization of certain ill-posed problems in signal and image processing. We use a preconditioned conjugate gradient algorithm to compute a regularized solution to this linear system given noisy data. Our preconditioner is a Cauchy-like block diagonal approximation to an orthogonal transformation of ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید