Fast algorithms, based on the unsymmetric look-ahead Lanczos and the Arnoldi process, are developed for the estimation of the functional (f)= uf(A)v for xed u; v and A, where A∈Rn×n is a largescale unsymmetric matrix. Numerical results are presented which validate the comparable accuracy of both approaches. Although the Arnoldi process reaches convergence more quickly in some cases, it has grea...

The eeciency of solving sparse linear systems on parallel processors and more complex multicluster architectures such as Cedar is greatly enhanced if relatively large grain computational tasks can be assigned to each cluster or processor. The ordering of a system into a bordered block upper triangular form facilitates a reasonable large-grain partitioning. A new algorithm which produces this fo...

In this paper, a combined fuzzy logic and unsymmetric trimmed median filter approach is proposed to remove the high density salt and pepper noise in gray scale and colour images. This algorithm is a combination of decision based unsymmetrical trimmed median filter and fuzzy thresholding technique to preserve edges and fine details in an image. The decision based unsymmetric trimmed median filte...

A dinuclear Rh(− i )/Rh( ) complex bridged by tridentate phosphinine ligands was prepared reduction of the corresponding Rh( complex. An unsymmetric bridging mode differentiated electronic environments Rh centres.

Sparse matrix factorization algorithms for general problems are typically characterized by irregular memory access patterns that limit their performance on parallel-vector supercomputers. For symmetric problems, methods such as the multifrontal method avoid indirect addressing in the innermost loops by using dense matrix kernels. However, no efficient LU factorization algorithm based primarily ...

In sections 1, 2, 3, 4 the many-time and one-time functional calculus is developed for the anharmonic oscilator in analogy to the requirements of nonlinear spinor theory. In section 5 the N.T.D.-method is discussed for the eigenvalue functional equation. It is shown that the N.T.D.method admits different representations, namely a symmetric one and an unsymmetric one. The proof of convergence is...

We review three algorithms that scale the in nity-norm of each row and column in a matrix to 1. The rst algorithm applies to unsymmetric matrices, and uses techniques from graph theory to scale the matrix. The second algorithm applies to symmetric matrices, and is notable for being asymptotically optimal in terms of operation counts. The third is an iterative algorithm that works for both symme...