Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniel J. Tylavsky

dblp:123/6624 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1988
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 4 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
High-performance computing · 100%
Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing › numerical linear algebra
matrix factorization
0.021986
Generalization of the matrix inversion lemma · Proc. IEEE 1986
Quadrant interlocking factorization: A form of block L-U factorization · Proc. IEEE 1986
High-performance computing
numerical linear algebra
0.021986
Generalization of the matrix inversion lemma · Proc. IEEE 1986
Quadrant interlocking factorization: A form of block L-U factorization · Proc. IEEE 1986
High-performance computing
parallel numerical algorithms
0.021986
Generalization of the matrix inversion lemma · Proc. IEEE 1986
Quadrant interlocking factorization: A form of block L-U factorization · Proc. IEEE 1986
Physical-layer communications › transmission media
transmission line
0.011987
Electric field of a transmission line over multilayered media · Proc. IEEE 1987
High-performance computing › numerical linear algebra
matrix inversion
0.011986
Generalization of the matrix inversion lemma · Proc. IEEE 1986

Methods — techniques the papers use, named apart from their topics

two-dimensional fourier transform · 0.0quadrant interlocking factorization · 0.0matrix inversion lemma · 0.0jacobi iteration · 0.0LU decomposition · 0.0
YearPublicationVenuePosition
1988 Comments, with reply, on 'Closed-form solution for underground impedance calculations'
abstract
D.J. Tylavsky et al. (see ibid., vol.74, no.9, p.1290-1292, 1986) formulate the boundary value problem of an electric line source eccentrically located in a cylindrical cavity. Their solution is consistent with the full-wave solution for a similar problem arising in electrical geophysics. The commenter claims that, in reducing their solution to a simpler form, the authors make some physical approximations which are questionable. In replying, Tylavsky et al. agree with Wait's comments that the application of a planar image model to the case of a conductor eccentrically located in a cylindrical dielectric is indeed a nontrivial problem.>
James R. Wait, Daniel J. Tylavsky
Proc. IEEE2
1987 Electric field of a transmission line over multilayered media
abstract
The two-dimensional Fourier transform is used to derive an expression for the electric field and impedance associated with a transmission line with a multilayered earth return. The expressions are based on a model of the earth which includes arbitrary horizontal stratification with differing resistivities and permeabilities. A method is proposed to extend the applicability of these results to conductors over multilayered media with varying permitivities such as semiconductor devices.
Ibrahim S. Moghram, Daniel J. Tylavsky
Proc. IEEE2
1986 Quadrant interlocking factorization: A form of block L-U factorization
abstract
A new factorization technique, known as Quadrant Interlocking Factorization (QIF), has recently been shown to exhibit a degree of inherent parallelism which is superior to that of L-U factorization. It is shown here that the QIF method may be derived more simply using block L-U factorization (BLUF) techniques.
Daniel J. Tylavsky
Proc. IEEE1
1986 Generalization of the matrix inversion lemma
abstract
A generalized form of the matrix inversion lemma is shown which allows particular forms of this lemma to be derived simply. The relationships between this direct method for solving linear matrix equations, lower-diagonal-upper decomposition, and iterative methods such as point-Jacobi and Hotelling's method are established. The generalized form is used to derive a new factorization scheme and a new matrix inversion algorithm with a high degree of parallelism.
Daniel J. Tylavsky, Guy R. L. Sohie
Proc. IEEE1