Browsing by Subject "Linear equations"

Filter results by typing the first few letters
Now showing 1 - 6 of 6
  • Thumbnail Image
    ItemOpen Access
    Characteristic equations for the lasing Modes of infinite periodic chain of quantum wires
    (IEEE, 2008-06) Byelobrov, V. O.; Benson, T. M.; Altıntaş, Ayhan; Nosich, A.I.
    In this paper, we study the lasing modes of a periodic open optical resonator. The resonator is an infinite chain of active circular cylindrical quantum wires standing in tree space. Characteristic equations for the frequencies and associated linear thresholds of lasing are derived. These quantities are considered as eigenvalues of specific electromagnetic-field problem with "active" imaginary part of the cylinder material's refractive index - Lasing Eigenvalue Problem (LEP). ©2008 IEEE.
  • Thumbnail Image
    ItemOpen Access
    Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
    (Elsevier, 2005) Pekergin, N.; Dayar T.; Alparslan, D. N.
    This paper presents an improved version of a componentwise bounding algorithm for the state probability vector of nearly completely decomposable Markov chains, and on an application it provides the first numerical results with the type of algorithm discussed. The given two-level algorithm uses aggregation and stochastic comparison with the strong stochastic (st) order. In order to improve accuracy, it employs reordering of states and a better componentwise probability bounding algorithm given st upper- and lower-bounding probability vectors. Results in sparse storage show that there are cases in which the given algorithm proves to be useful. © 2004 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    ItemOpen Access
    Computing moments of first passage times to a subset of states in Markov chains
    (SIAM, 2005) Dayar T.; Akar, N.
    This paper presents a relatively efficient and accurate method to compute the moments of first passage times to a subset of states in finite ergodic Markov chains. With the proposed method, the moment computation problem is reduced to the solution of a linear system of equations with the right-hand side governed by a novel recurrence for computing the higher-order moments. We propose using a form of the Grassmann-Taksar-Heyman (GTH) algorithm to solve these linear equations. Due to the form of the linear systems involved, the proposed method does not suffer from the drawbacks associated with GTH in a row-wise sparse implementation. © 2005 Society for Industrial and Applied Mathematics.
  • Thumbnail Image
    ItemOpen Access
    An exponential stability result for the wave equation
    (Elsevier, 2002) Morgül, Ö.
    We consider a system described by the one-dimensional linear wave equation in a bounded domain with appropriate boundary conditions. To stabilize this system, we propose a dynamic boundary controller applied at the free end of the system. The transfer function of the proposed controller is a proper rational function which consists of a strictly positive real function and some poles on the imaginary axis. We then show that under some conditions the closed-loop system is exponentially stable. © 2002 Published by Elsevier Ltd.
  • Thumbnail Image
    ItemOpen Access
    Iterative algorithms for solution of large sparse systems of linear equations on hypercubes
    (IEEE, 1988) Aykanat, Cevdet; Özgüner, F.; Ercal, F.; Sadayappan, P.
    Finite-element discretization produces linear equations in the form Ax=b, where A is large, sparse, and banded with proper ordering of the variables x. The solution of such equations on distributed-memory message-passing multiprocessors implementing the hypercube topology is addressed. Iterative algorithms based on the conjugate gradient method are developed for hypercubes designed for coarse-grained parallelism. The communication requirements of different schemes for mapping finite-element meshes onto the processors of a hypercube are analyzed with respect to the effect of communication parameters of the architecture. Experimental results for a 16-node Intel 80386-based iPSC/2 hypercube are presented and discussed.
  • Thumbnail Image
    ItemOpen Access
    Parallel preconditioners for solutions of dense linear systems with tens of millions of unknowns
    (2007-11) Malas, Tahir; Ergül, Özgür; Gürel, Levent
    We propose novel parallel preconditioning schemes for the iterative solution of integral equation methods. In particular, we try to improve convergence rate of the ill-conditioned linear systems formulated by the electric-field integral equation, which is the only integral-equation formulation for targets having open surfaces. For moderate-size problems, iterative solution of the near-field system enables much faster convergence compared to the widely used sparse approximate inverse preconditioner. For larger systems, we propose an approximation strategy to the multilevel fast multipole algorithm (MLFMA) to be used as a preconditioner. Our numerical experiments reveal that this scheme significantly outperforms other preconditioners. With the combined effort of effective preconditioners and an efficiently parallelized MLFMA, we are able to solve targets with tens of millions of unknowns, which are the largest problems ever reported in computational electromagnetics. ©2007 IEEE.