نتایج جستجو برای: thomas algorithm

تعداد نتایج: 778555  

Journal: :Combinatorics, Probability & Computing 2005
Dillon Mayhew

Suppose that q is a prime power exceeding five. For every integer N there exists a 3-connected GF(q)-representable matroid, in particular, a free spike or a free swirl, that has at least N inequivalent GF(q)-representations. In contrast to this, Geelen, Oxley, Vertigan and Whittle have conjectured that, for any integer r > 2, there exists an integer n(q, r) such that if M is a 3-connected GF(q)...

1993
Shouchuan Zhang

In this paper, we introduce a new concept of generalized matrix rings and build up the general theory of radicals for g.m.rings. Meantime, we obtain r̄b(A) = g.m.rb(A) = ∑ {rb(Aij) | i, j ∈ I} = rb(A)

2017
Elliot T. Berkman Jordan L. Livingston Lauren E. Kahn

word count: 209 Full text word count: 15,305 Figures: 3 Address correspondence to: Elliot Berkman [email protected] 1227 University of Oregon Eugene, OR USA 97403-1227 Phone: 541-346-4909 Fax: 541-346-4911 IN PRESS AT PSYCHOLOGICAL INQUIRY IDENTITY-VALUE MODEL 2

Journal: :CoRR 2007
Weiyu Xu

We address the problem,‘Is a local tree structure sufficient for the local optimality of message passing algorithm in low density parity check codes?’.It is shown that the answer is negative. Using this observation, we pinpoint a flaw in the proof of Theorem 1 in the paper ‘The Capacity of Low-Density ParityCheck Codes Under Message-Passing Decoding’ by Thomas J. Richardson and Rüdiger L. Urban...

2016
J. Aasi B. P. Abbott R. Abbott T. D. Abbott M. R. Abernathy F. Acernese K. Ackley C. Adams T. Adams P. Addesso R. X. Adhikari V. B. Adya C. Affeldt M. Agathos K. Agatsuma N. Aggarwal O. D. Aguiar A. Ain P. Ajith B. Allen A. Allocca D. V. Amariutei M. Andersen S. B. Anderson W. G. Anderson K. Arai M. C. Araya C. C. Arceneaux J. S. Areeda N. Arnaud G. Ashton S. M. Aston P. Astone P. Aufmuth C. Aulbert S. Babak P. T. Baker F. Baldaccini G. Ballardin S. W. Ballmer J. C. Barayoga S. E. Barclay B. C. Barish D. Barker F. Barone B. Barr L. Barsotti M. Barsuglia J. Bartlett M. A. Barton I. Bartos R. Bassiri A. Basti J. C. Batch C. Baune V. Bavigadda B. Behnke M. Bejger C. Belczynski S. Bell B. K. Berger S. Bhagwat R. Bhandare I. A. Bilenko G. Billingsley J. Birch R. Birney S. Biscans M. Bitossi C. Biwer M. A. Bizouard J. K. Blackburn C. D. Blair D. Blair S. Bloemen O. Bock T. P. Bodiya M. Boer G. Bogaert P. Bojtos C. Bond F. Bondu R. Bonnand R. Bork M. Born V. Boschi Sukanta Bose C. Bradaschia P. R. Brady V. B. Braginsky M. Branchesi V. Branco J. E. Brau T. Briant A. Brillet M. Brinkmann V. Brisson P. Brockill A. F. Brooks D. A. Brown D. Brown D. D. Brown C. C. Buchanan A. Buikema T. Bulik H. J. Bulten A. Buonanno D. Buskulic C. Buy R. L. Byer L. Cadonati G. Cagnoli J. Calderón Bustillo E. Calloni J. B. Camp K. C. Cannon J. Cao C. D. Capano E. Capocasa F. Carbognani

Adams, Thomas, Coughlin, Scott Benjamin, Edwards, M., Fairhurst, Stephen, Fays, Maxime, Hannam, Mark, Hopkins, Paul, Macdonald, E. P., Ohme, Frank, Pannarale Greco, Francesco, Predoi, Valeriu, Purrer, M., Schutz, Bernard, Sutton, Patrick J. and Williamson, Andrew R. 2016. Search of the Orion spur for continuous gravitational waves using a loosely coherent algorithm on data from LIGO interferome...

Journal: :Discrete Mathematics 2008
Vladimir Gurvich

Graph G is called cyclically orientable (CO) if it admits an orientation in which every simple chordless cycle is cyclically oriented. This family of graphs was introduced by Barot, Geiss, and Zelevinsky in their paper “Cluster algebras of finite type and positive symmetrizable matrices”, J. London Math. Soc. 73 Part 3 (2006), 545-564. The authors obtained several nice characterizations of CO-g...

Ghafouri, H. R., Jamei, M.,

In this study, we present a numerical solution for the two-phase incompressible flow in the porous media under isothermal condition using a hybrid of the linear lower-order nonconforming finite element and the interior penalty discontinuous Galerkin (DG) method. This hybridization is developed for the first time in the two-phase modeling and considered as the main novelty of this research.The p...

Journal: :Mathematics 2022

The work is devoted to developing the parallel algorithms for solving initial boundary problem time-fractional diffusion equation. After applying finite-difference scheme approximate basis equation, reduced a system of linear algebraic equations each subsequent time level. developed are based on Thomas algorithm, sweep and accelerated over-relaxation method this system. Stability approximation ...

2014
H. S. Prasad Y. N. Reddy

Abstract In this paper a fitted second-order finite difference method is presented for solving singularly perturbed two-point boundary value problems with the boundary layer at both end (left and right) points. We have introduced a fitting factor in second-order tri-diagonal finite difference scheme and it is obtained from the theory of singular perturbations. The efficient Thomas algorithm is ...

2013
Aditya Singh Benjamin Zahneisen Brian Keating Michael Herbst Maxim Zaitsev Thomas Ernst

single-marker tracking and (b) adaptive tracking with 2 markers. If marker 1 becomes obscured, the algorithm switches to marker 2 (if visible) to reconstruct the location of marker 1 and provide correct feedback. 3744 Optical Motion Tracking With Two Markers for Robust Prospective Motion Correction Aditya Singh, Benjamin Zahneisen, Brian Keating, Michael Herbst, Maxim Zaitsev, and Thomas Ernst ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید