By defining two important terms called basic perturbation vectors and obtaining their linear bounds, we obtain the componentwise bounds for unitary factors upper triangular of generalized Schur decomposition. The diagonal elements invariant subspace are also derived. From former, present an bound a condition number eigenvalue. Furthermore, with numerical iterative method, nonlinear decompositio...

We prove that certain parabolic Kazhdan-Lusztig polynomials calculate the graded decomposition matrices of v-Schur algebras given by the Jantzen filtration of Weyl modules, confirming a conjecture of Leclerc and Thibon.

Abstract. This paper addresses some numerical and theoretical aspects of dual Schur domain decomposition methods for linear first-order transient partial differential equations. The spatially discrete system of equations resulting from a dual Schur domain decomposition method can be expressed as a system of differential algebraic equations (DAEs). In this work, we consider the trapezoidal famil...

We present a parallelization of Parlett s algorithm for computing arbitrary functions of upper triangular matrices The parallel algorithm preserves the numerical stability properties of the serial algorithm and is suitable for implementation on coarse grain parallel computers The algorithm ob tains a speedup of for matrices of size greater than as our analysis and actual implementation on a pro...

This paper presents a method for complexity reduction in reachability analysis and safety-preserving controller synthesis via Schur-based decomposition. The decomposition results in either decoupled or weaklycoupled (lower dimensional) subsystems. Reachable sets, computed independently for each subsystem, are back-projected and intersected to yield an overapproximation of the actual reachable s...

reduced differental transform method (rdtm), which isone of the useful and effective numerical method, is applied to solve nonlinear time-dependent foam drainage equation (fde) with different initial conditions. we compare our method with the famous adomian decomposition and laplace decomposition methods. the obtained resultsdemonstrated that rdtm is a powerful tool for solving nonlinear par...

We develop a data-sparse and accurate approximation of the normalised hyperbolic operator sine family generated by a strongly P-positive elliptic operator deened in 4, 7]. In the preceding papers 14]-18], a class of H-matrices has been analysed which are data-sparse and allow an approximate matrix arithmetic with almost linear complexity. An H-matrix approximation to the operator exponent with ...

Domain decomposition is a strategy designed to be used on parallel machines. This leads hybrid methods between direct and iterative solvers allows users benefit from the advantages of both. Lately, growing size simulations in electromagnetics brought light interest using domain decomposition. Nonlinearity also one problems specificities where need for an efficient solver high. paper provides co...

Abstract In previous works, it was suggested to use Steklov eigenvalues for Maxwell equations as target signature nondestructive testing, and recognized that this eigenvalue problem cannot be reformulated a standard compact operator. Consequently, modified with the desired properties proposed. We report apart countable set of particular frequencies, spectrum original self-adjoint consists three...

Let B be a block of an Iwahori–Hecke algebra or q-Schur algebra of the symmetric group. The decomposition matrix for B may be obtained from the decomposition matrix of the corresponding block B′ in infinite characteristic by post-multiplying by an adjustment matrix; since (by a deep theorem of Ariki) there is an algorithm for computing the decomposition matrix for B′, the hard part of the decom...