Browsing by Keywords "Matrix algebra"
Now showing items 21-40 of 81
-
Effect of cross-sectional geometry on the RPA plasmons of quantum wires
(Pergamon Press, 1994)The effect of cross-sectional geometry on both the intrasubband plasmon and intersubband plasmon of a quantum wire is investigated within a two-subband RPA scheme. Exact analytical electronic wavefunctions for circular, ... -
An effective model to decompose linear programs for parallel solution
(Springer, 1996-08)Although inherent parallelism in the solution of block angulax Linear Programming (LP) problems has been exploited in many research works, the literature that addresses decomposing constraint matrices into block angular ... -
Effective use of space for pivot-based metric indexing structures
(IEEE, 2008-04)Among the metric space indexing methods, AESA is known to produce the lowest query costs in terms of the number of distance computations. However, its quadratic construction cost and space consumption makes it infeasiblefor ... -
Efficient evaluation of spatial-domain MoM matrix entries in the analysis of planar stratified geometries
(IEEE, 2000)An efficient hybrid method for evaluation of spatial-domain method-of-moments (MoM) matrix entries is presented in this paper. It has already been demonstrated that the introduction of the closed-form Green's functions ... -
An efficient method for electromagnetic characterization of 2-D geometries in stratified media
(IEEE, 2002)A numerically efficient technique, based on the spectral-domain method of moments (MoM) in conjunction with the generalized pencil-of-functions (GPOF) method, is developed for the characterization of two-dimensional ... -
Efficient use of closed-form Green's functions for three-dimensional problems involving multilayered media
(IEEE, 1994-06)With the use of casting the spatial domain Green's functions into closed forms approach, it was demonstrated that the computational efficiency of the method of moments (MoM) for the solution of the mixed potential integral ... -
Efficient vectorization of forward/backward substitutions in solving sparse linear equations
(IEEE, 1994)Vector processors have promised an enormous increase in computing speed for computationally intensive and time-critical power system problems which require the repeated solution of sparse linear equations. Due to short ... -
Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for parallel matrix-vector multiplies
(SIAM, 2004)This paper addresses the problem of one-dimensional partitioning of structurally unsymmetric square and rectangular sparse matrices for parallel matrix-vector and matrix-transpose-vector multiplies. The objective is to ... -
Estimation of depth fields suitable for video compression based on 3-D structure and motion of objects
(Institute of Electrical and Electronics Engineers, 1998-06)Intensity prediction along motion trajectories removes temporal redundancy considerably in video compression algorithms. In three-dimensional (3-D) object-based video coding, both 3-D motion and depth values are required ... -
Estimation of Spurious Radiation from Microstrip Etches Using Closed-Form Green’s Functions
(IEEE, 1992)The problem of spurious radiation from electronic packages is considered in this paper by investigating the power radiated from microstrip etches that are excited by arbitrarily-located current sources, and terminated by ... -
Exploiting locality in sparse matrix-matrix multiplication on many-core rchitectures
(IEEE Computer Society, 2017)Exploiting spatial and temporal localities is investigated for efficient row-by-row parallelization of general sparse matrix-matrix multiplication (SpGEMM) operation of the form C=A,B on many-core architectures. Hypergraph ... -
Extension of forward backward method with DFT based acceleration algorithm for the efficient analysis of large periodic arrays with arbitrary boundaries
(IEEE, 2003)An extension of Forward-Backward (FB) with Discrete Fourier Transform (DFT) based acceleration approach is presented. This is given to provide a relatively efficient analysis of EM radiation/scattering from an electrically ... -
Fast and accurate analysis of large-scale composite structures with the parallel multilevel fast multipole algorithm
(Optical Society of America, 2013)Accurate electromagnetic modeling of complicated optical structures poses several challenges. Optical metamaterial and plasmonic structures are composed of multiple coexisting dielectric and/or conducting parts. Such ... -
Fast direct (noniterative) solvers for integral-equation formulations of scattering problems
(IEEE, 1998)A family of direct (noniterative) solvers with reduced computational complexity is proposed for solving problems involving resonant or near-resonant structures. Based on the recursive interaction matrix algorithm, the ... -
Fast noniterative steepest descent path algorithm for planar and quasi-planar patch geometries
(IEEE, 1998)The fast noniterative steepest descent path (SDP) algorithm for planar and quasi-planar patch geometries are discussed. The comparison of scattered fields as computed by the method of moments (MOM) and fast direct algorithm ... -
Fast optimal load balancing algorithms for 1D partitioning
(Academic Press, 2004)The one-dimensional decomposition of nonuniform workload arrays with optimal load balancing is investigated. The problem has been studied in the literature as the "chains-on-chains partitioning" problem. Despite the rich ... -
Fitting matrix geometric distributions by model reduction
(Taylor and Francis Inc., 2015)A novel algorithmic method is proposed to fit matrix geometric distributions of desired order to empirical data or arbitrary discrete distributions. The proposed method effectively combines two existing approaches from two ... -
Fixed zeros of decentralized control systems
(IEEE, 2000)This paper considers the notion of decentralized fixed zeros for linear, time-invariant, finite-dimensional systems. For an N-channel plant that is free of unstable decentralized fixed modes, an unstable decentralized fixed ... -
The fractional Fourier domain decomposition
(Elsevier, 1999)We introduce the fractional Fourier domain decomposition. A procedure called pruning, analogous to truncation of the singular-value decomposition, underlies a number of potential applications, among which we discuss fast ... -
Fractional free space, fractional lenses, and fractional imaging systems
(OSA - The Optical Society, 2003)Continuum extensions of common dual pairs of operators are presented and consolidated, based on the fractional Fourier transform. In particular, the fractional chirp multiplication, fractional chirp convolution, and ...
