This article introduces a robust and affordable method to compute nullspace generalized inverse of finite element operators involved in dual domain decomposition methods. The methodology relies on the operator partial factorization analysis well chosen Schur complement. sparse linear is interpreted as network graph centrality measures are used select condensation variables. Eigenvector, Katz Pa...

A visually meaningful image encryption scheme with an asymmetric structure based on the discrete wavelet transform (DWT) and Schur decomposition is proposed in this study. First, RSA algorithm used to generate initial values for chaotic system produce random sequence. Then, both scrambling diffusion operations are performed plain obtain preencrypted image. Moreover, applied upper triangular ort...

We present an optimization-level domain decomposition (DD) preconditioner for the solution of advection dominated elliptic linear–quadratic optimal control problems, which arise in many science and engineering applications. The DD preconditioner is based on a decomposition of the optimality conditions for the elliptic linear–quadratic optimal control problem into smaller subdomain optimality co...

a 2-d heat conduction model has been solved by using the adomian decomposition method topredict the transient temperature and heat flux distribution in a thick solid that is irradiated by a laser source.the laser source may operate in a continuous wave (cw) mode or repeated pulse (rp) mode and may havearbitrary, spatial and temporal profiles.a generalized solution containing five-terms approxim...

Through the matrix rank method, this paper gives necessary and sufficient conditions for a partitioned matrix to have generalized inverses with Banachiewicz-Schur forms. In addition, this paper investigates the idempotency of generalized Schur complements in a partitioned idempotent matrix.

Through the matrix rank method, this paper gives necessary and sufficient conditions for a partitioned matrix to have generalized inverses with Banachiewicz-Schur forms. In addition, this paper investigates the idempotency of generalized Schur complements in a partitioned idempotent matrix.

An algorithm is proposed for computing primary matrix Lambert W functions of a square matrix A, which are solutions of the matrix equation WeW = A. The algorithm employs the Schur decomposition and blocks the triangular form in such a way that Newton’s method can be used on each diagonal block, with a starting matrix depending on the block. A natural simplification of Newton’s method for the La...