A method for approximate computation of waveguide scattering matrices

2020 ◽  
Vol 75 (3) ◽  
pp. 509-568
Author(s):  
B. A. Plamenevskii ◽  
A. S. Poretskii ◽  
O. V. Sarafanov
Keyword(s):  
Approximate Computation ◽  
Scattering Matrices

Wave-Mode Coordinates and Scattering Matrices for Wave Propagation.

1986 ◽  
Author(s):  
James H. Williams ◽  
Nagem Jr. ◽  
Yeung Raymond J. ◽  
Hubert K.
Keyword(s):  
Wave Propagation ◽  
Wave Mode ◽  
Scattering Matrices

Representations of 3-D Scattering Matrices

1991 ◽  
Author(s):  
Jerold R. Bottiger
Keyword(s):  
Scattering Matrices

scholarly journals Isoscattering strings of concatenating graphs and networks

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Michał Ławniczak ◽  
Adam Sawicki ◽  
Małgorzata Białous ◽  
Leszek Sirko
Keyword(s):  
Trace Function ◽  
Quantum Graphs ◽  
Mathematical Approach ◽  
Large Graphs ◽  
Graphs And Networks ◽  
Scattering Matrices ◽  
Theoretical Predictions ◽  
Infinite Strings ◽  
Microwave Networks ◽  
Insight Into

AbstractWe identify and investigate isoscattering strings of concatenating quantum graphs possessing n units and 2n infinite external leads. We give an insight into the principles of designing large graphs and networks for which the isoscattering properties are preserved for $$n \rightarrow \infty $$ n → ∞ . The theoretical predictions are confirmed experimentally using $$n=2$$ n = 2 units, four-leads microwave networks. In an experimental and mathematical approach our work goes beyond prior results by demonstrating that using a trace function one can address the unsettled until now problem of whether scattering properties of open complex graphs and networks with many external leads are uniquely connected to their shapes. The application of the trace function reduces the number of required entries to the $$2n \times 2n $$ 2 n × 2 n scattering matrices $${\hat{S}}$$ S ^ of the systems to 2n diagonal elements, while the old measures of isoscattering require all $$(2n)^2$$ ( 2 n ) 2 entries. The studied problem generalizes a famous question of Mark Kac “Can one hear the shape of a drum?”, originally posed in the case of isospectral dissipationless systems, to the case of infinite strings of open graphs and networks.

Approximate computation of multidimensional aggregates of sparse data using wavelets

1999 ◽  
Vol 28 (2) ◽  
pp. 193-204 ◽  
Author(s):  
Jeffrey Scott Vitter ◽  
Min Wang
Keyword(s):  
Sparse Data ◽  
Approximate Computation

Similarity between two scattering matrices

2001 ◽  
Vol 37 (3) ◽  
pp. 193 ◽  
Author(s):  
Jian Yang ◽  
Ying-Ning Peng ◽  
Shi-Ming Lin
Keyword(s):  
Scattering Matrices

scholarly journals Method for computing waveguide scattering matrices in the vicinity of thresholds

2014 ◽  
Vol 26 (1) ◽  
pp. 91-116 ◽  
Author(s):  
B. A. Plamenevskiǐ ◽  
A. S. Poretskiǐ ◽  
O. V. Sarafanov
Keyword(s):  
Scattering Matrices
Sign in / Sign up

Export Citation Format

Share Document