Relevant bibliographies by topics / Bandwidth matrix / Journal articles
To see the other types of publications on this topic, follow the link: Bandwidth matrix.

Journal articles on the topic 'Bandwidth matrix'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Bandwidth matrix.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Bauder, Javan M., David R. Breininger, M. Rebecca Bolt, Michael L. Legare, Christopher L. Jenkins, and Kevin McGarigal. "The role of the bandwidth matrix in influencing kernel home range estimates for snakes using VHF telemetry data." Wildlife Research 42, no. 5 (2015): 437. http://dx.doi.org/10.1071/wr14233.

Full text
Abstract:
Context Despite the diversity of available home range estimators, no single method performs equally well in all circumstances. It is therefore important to understand how different estimators perform for data collected under diverse conditions. Kernel density estimation is a popular approach for home range estimation. While many studies have evaluated different kernel bandwidth selectors, few studies have compared different formulations of the bandwidth matrix using wildlife telemetry data. Additionally, few studies have compared the performance of kernel bandwidth selectors using VHF radio-telemetry data from small-bodied taxa. Aims In this study, we used eight different combinations of bandwidth selectors and matrices to evaluate their ability to meet several criteria that could be potentially used to select a home range estimator. Methods We used handheld VHF telemetry data from two species of snake displaying non-migratory and migratory movement patterns. We used subsampling to estimate each estimator’s sensitivity to sampling duration and fix rate and compared home range size, the number of disjunct volume contours and the proportion of telemetry fixes not included in those contours among estimators. Key Results We found marked differences among bandwidth selectors with regards to our criteria but comparatively little difference among bandwidth matrices for a given bandwidth selector. Least-squares cross-validation bandwidths exhibited near-universal convergence failure whereas likelihood cross-validation bandwidths showed high sensitivity to sampling duration and fix rate. The reference, plug-in and smoothed cross-validation bandwidths were more robust to variation in sampling intensity, with the former consistently producing the largest estimates of home range size. Conclusions Our study illustrates the performance of multiple kernel bandwidth estimators for estimating home ranges with datasets typical of many small-bodied taxa. The reference and plug-in bandwidths with an unconstrained bandwidth matrix generally had the best performance. However, our study concurs with earlier studies indicating that no single home range estimator performs equally well in all circumstances. Implications Although we did not find strong differences between bandwidth matrices, we encourage the use of unconstrained matrices because of their greater flexibility in smoothing data not parallel to the coordinate axes. We also encourage researchers to select an estimator suited to their study objectives and the life history of their study organism.
APA, Harvard, Vancouver, ISO, and other styles
2

Horová, Ivana, Jan Koláček, and Kamila Vopatová. "Visualization and Bandwidth Matrix Choice." Communications in Statistics - Theory and Methods 41, no. 4 (2012): 759–77. http://dx.doi.org/10.1080/03610926.2010.529539.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Lim, Andrew, Brian Rodrigues, and Fei Xiao. "Heuristics for matrix bandwidth reduction." European Journal of Operational Research 174, no. 1 (2006): 69–91. http://dx.doi.org/10.1016/j.ejor.2005.02.066.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bora, Pritom J., T. R. Suresh Kumar, and Daniel Q. Tan. "Enhancement of microwave absorption bandwidth of MXene nanocomposites through macroscopic design." Royal Society Open Science 7, no. 8 (2020): 200456. http://dx.doi.org/10.1098/rsos.200456.

Full text
Abstract:
MXene, the new family of two-dimensional materials having numerous nanoscale layers, is being considered as a novel microwave absorption material. However, MXene/functionalized MXene-loaded polymer nanocomposites exhibit narrow reflection loss (RL) bandwidth (RL less than or equal to −10 dB). In order to enhance the microwave absorption bandwidth of MXene hybrid-matrix materials, for the first time, macroscopic design approach is carried out for TiO 2 -Ti 3 C 2 T x MXene and Fe 3 O 4 @TiO 2 -Ti 3 C 2 T x MXene hybrids through simulation. The simulated results indicate that use of pyramidal meta structure of MXene can significantly tune the RL bandwidth. For optimized MXene hybrid-matrix materials pyramid pattern, the bandwidth enhances to 3–18 GHz. Experimental RL value well matched with the simulated RL. On the other hand, the optimized Fe 3 O 4 @TiO 2 -Ti 3 C 2 T x hybrid exhibits two specific absorption bandwidths (minimum RL value - −47 dB). Compared with other two-dimensional nanocomposites such as graphene or Fe 3 O 4 -graphene, MXene hybrid-matrix materials show better microwave absorption bandwidth in macroscopic pattern.
APA, Harvard, Vancouver, ISO, and other styles
5

Hu, Xijian, Yaori Lu, Huiguo Zhang, Haijun Jiang, and Qingdong Shi. "Selection of the Bandwidth Matrix in Spatial Varying Coefficient Models to Detect Anisotropic Regression Relationships." Mathematics 9, no. 18 (2021): 2343. http://dx.doi.org/10.3390/math9182343.

Full text
Abstract:
The commonly used Geographically Weighted Regression (GWR) fitting method for a spatial varying coefficient model is to select a bandwidth h for the geographic location (u, v), and assign the same weight to the two dimensions. However, spatial data usually present anisotropy. The introduction of a two-dimensional bandwidth matrix not only gives weight from two dimensions separately, but also increases the direction of kernel smoothness. The adaptive bandwidth matrix is more flexible. Therefore, in this paper, a two dimensional bandwidth matrix is introduced into the spatial varying coefficient model for parameter estimation. Through simulation experiments, the results obtained under the adaptive bandwidth matrix are compared with those obtained under the global bandwidth matrix, indicating the effectiveness of introducing the adaptive bandwidth matrix.
APA, Harvard, Vancouver, ISO, and other styles
6

Esposito, A., M. S. Fiorenzo Catalano, F. Malucelli, and L. Tarricone. "A new matrix bandwidth reduction algorithm." Operations Research Letters 23, no. 3-5 (1998): 99–107. http://dx.doi.org/10.1016/s0167-6377(98)00040-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Koláček, Jan, and Ivana Horová. "Bandwidth matrix selectors for kernel regression." Computational Statistics 32, no. 3 (2017): 1027–46. http://dx.doi.org/10.1007/s00180-017-0709-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Campos, Vicente, Estefanía Piñana, and Rafael Martí. "Adaptive memory programming for matrix bandwidth minimization." Annals of Operations Research 183, no. 1 (2009): 7–23. http://dx.doi.org/10.1007/s10479-009-0573-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Macarie, Ioan I. "Decreasing the bandwidth of a transition matrix." Information Processing Letters 53, no. 6 (1995): 315–20. http://dx.doi.org/10.1016/0020-0190(94)00218-n.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

MacDonald, R. I. "Optoelectronic matrix switching." Canadian Journal of Physics 67, no. 4 (1989): 389–93. http://dx.doi.org/10.1139/p89-069.

Full text
Abstract:
Because cross talk from electromagnetic coupling increases with frequency, it is difficult to design matrix switches for high-frequency electronic signals. Signals on optical carriers are easier to isolate but more difficult to switch. A hybrid technique exploiting passive optical-signal distribution and switching by optoelectronic effects shows good promise for high isolation matrices to handle signals in the dc to 10 GHz range. The key elements for such optoelectronic switches are optical detectors that have switchable sensitivity.Initial efforts in optoelectronic switching used silicon diode detectors and forward bias to establish the off-state. Recent work has turned primarily to photoconductors fabricated in GaAs or other compound semiconductors. Such photoconductors can have very wide response bandwidths and have the advantage of a zero-bias off-state. Efforts have also been made to develop bipolar detectors that do not need forward bias for the off-state.Experimental work has progressed to the demonstration of complete matrices capable of switching up to eight incoming signals to as many outgoing lines, at bandwidths up to 500 MHz and cross-talk levels below 50 dB. Results for individual switching devices give promise of matrices for many tens of lines and bandwidths to several gigahertz. Monolithic integration of GaAs photoconductor switch arrays has been demonstrated, and work progresses to include integrated control devices and amplifiers.Matrix switches of large dimension and very large bandwidth are expected to have significant applications in areas other than communications switching. In particular, such matrices can be used to set up patterns of delay and signal recombination, using fibre delay lines, to provide rapidly selectable wide-band delay for phasing and other applications, or for wide-band tapped delay-line filters that can be reconfigured rapidly.A review of the current status in optoelectronic matrix switching is given.
APA, Harvard, Vancouver, ISO, and other styles
11

Micheal, Omojola, and Emrah Kilic. "A class of symmetric and non-symmetric band matrices via binomial coefficients." Special Matrices 9, no. 1 (2021): 321–30. http://dx.doi.org/10.1515/spma-2020-0142.

Full text
Abstract:
Abstract Symmetric matrix classes of bandwidth 2r + 1 was studied in 1972 through binomial coefficients. In this paper, non-symmetric matrix classes with the binomial coefficients are considered where r + s + 1 is the bandwidth, r is the lower bandwidth and s is the upper bandwidth. Main results for inverse, determinants and norm-infinity of inverse are presented. The binomial coefficients are used for the derivation of results.
APA, Harvard, Vancouver, ISO, and other styles
12

Qiu, Yumou, and Song Xi Chen. "Bandwidth Selection for High-Dimensional Covariance Matrix Estimation." Journal of the American Statistical Association 110, no. 511 (2015): 1160–74. http://dx.doi.org/10.1080/01621459.2014.950375.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Gonzaga de Oliveira, Sanderson L., and Libério M. Silva. "Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy." RAIRO - Operations Research 55, no. 4 (2021): 2247–64. http://dx.doi.org/10.1051/ro/2021102.

Full text
Abstract:
This paper studies heuristics for the bandwidth reduction of large-scale matrices in serial computations. Bandwidth optimization is a demanding subject for a large number of scientific and engineering applications. A heuristic for bandwidth reduction labels the rows and columns of a given sparse matrix. The algorithm arranges entries with a nonzero coefficient as close to the main diagonal as possible. This paper modifies an ant colony hyper-heuristic approach to generate expert-level heuristics for bandwidth reduction combined with a Hill-Climbing strategy when applied to matrices arising from specific application areas. Specifically, this paper uses low-cost state-of-the-art heuristics for bandwidth reduction in tandem with a Hill-Climbing procedure. The results yielded on a wide-ranging set of standard benchmark matrices showed that the proposed strategy outperformed low-cost state-of-the-art heuristics for bandwidth reduction when applied to matrices with symmetric sparsity patterns.
APA, Harvard, Vancouver, ISO, and other styles
14

Cuenca, Ángel, Ricardo Pizá, Julián Salt, and Antonio Sala. "Linear Matrix Inequalities in Multirate Control over Networks." Mathematical Problems in Engineering 2012 (2012): 1–22. http://dx.doi.org/10.1155/2012/768212.

Full text
Abstract:
This paper faces two of the main drawbacks in networked control systems: bandwidth constraints and timevarying delays. The bandwidth limitations are solved by using multirate control techniques. The resultant multirate controller must ensure closed-loop stability in the presence of time-varying delays. Some stability conditions and a state feedback controller design are formulated in terms of linear matrix inequalities. The theoretical proposal is validated in two different experimental environments: a crane-based test-bed over Ethernet, and a maglev based platform over Profibus.
APA, Harvard, Vancouver, ISO, and other styles
15

Piñana, Estefanı́a, Isaac Plana, Vicente Campos, and Rafael Martı́. "GRASP and path relinking for the matrix bandwidth minimization." European Journal of Operational Research 153, no. 1 (2004): 200–210. http://dx.doi.org/10.1016/s0377-2217(02)00715-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Mahdaviani, Kaveh, Soheil Mohajer, and Ashish Khisti. "Product Matrix MSR Codes With Bandwidth Adaptive Exact Repair." IEEE Transactions on Information Theory 64, no. 4 (2018): 3121–35. http://dx.doi.org/10.1109/tit.2018.2796599.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Reid, J. K., and J. A. Scott. "Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix." SIAM Journal on Matrix Analysis and Applications 28, no. 3 (2006): 805–21. http://dx.doi.org/10.1137/050629938.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Gonzaga de Oliveira, S. L., and L. M. Silva. "An ant colony hyperheuristic approach for matrix bandwidth reduction." Applied Soft Computing 94 (September 2020): 106434. http://dx.doi.org/10.1016/j.asoc.2020.106434.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Horová, Ivana, Jan Koláček, and Kamila Vopatová. "Full bandwidth matrix selectors for gradient kernel density estimate." Computational Statistics & Data Analysis 57, no. 1 (2013): 364–76. http://dx.doi.org/10.1016/j.csda.2012.07.006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Smyth, W. F. "Algorithms for the reduction of matrix bandwidth and profile." Journal of Computational and Applied Mathematics 12-13 (May 1985): 551–61. http://dx.doi.org/10.1016/0377-0427(85)90048-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Nguyen Thi, Thuy, Ngoc Tran Minh, Tu Vu Minh, and Dung Pham Thi. "STUDY ELECTROMAGNETIC WAVE INTERACTION OF ACTIVE-MATRIX THIN FILM TRANSISTORS." Journal of Science Natural Science 65, no. 10 (2020): 24–28. http://dx.doi.org/10.18173/2354-1059.2020-0044.

Full text
Abstract:
Active-matrix thin film transistors (TFTs) on glass substrates with a metal backplane, that are applied for flat panel displays, can be considered as a metamaterial absorber. In this study, TFT structures using doped silicon at source, drain, and channel terminals are investigated. These terminals are unchanged in size of 75 µm square and thickness of 5.3 µm. The electric conductivity is varied at the channel. The simulation results show that the structures with 500 S\m electric conductivity channels absorb incident electromagnetic waves with appropriately 100% at 758 GHz and a wide bandwidth of 20 GHz. As the electrical conductivity increases, the absorption and bandwidth are smaller at the main resonance peak. As the electrical conductivity decreases, the absorption falls at the resonance frequency, but the bandwidth is broadened. In addition, the electric field in the channel may influence the electron in the semiconductor and the electrical current between the source and drain terminals. By observing the electric field at the resonance frequency, we found that it is focused on the sides of channel terminals.
APA, Harvard, Vancouver, ISO, and other styles
22

Martı́, Rafael, Manuel Laguna, Fred Glover, and Vicente Campos. "Reducing the bandwidth of a sparse matrix with tabu search." European Journal of Operational Research 135, no. 2 (2001): 450–59. http://dx.doi.org/10.1016/s0377-2217(00)00325-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Megson, G. M., and D. J. Evans. "Matrix power generation using an optical reduced-bandwidth systolic array." IEE Proceedings J Optoelectronics 135, no. 6 (1988): 435. http://dx.doi.org/10.1049/ip-j.1988.0075.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Oudjida, A. K., S. Titr, and M. Hamarlain. "latency 2 I/O-bandwidth 2D-array matrix multiplication algorithm." COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering 21, no. 3 (2002): 377–92. http://dx.doi.org/10.1108/03321640210423298.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Chatchaikarn, A., Y. C. Chen, D. Yang, H. Gao, and G. P. Li. "HBT matrix amplifier with gain-cell enhancing gain and bandwidth." Electronics Letters 42, no. 1 (2006): 22. http://dx.doi.org/10.1049/el:20063223.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Martí, Rafael, Vicente Campos, and Estefanía Piñana. "A branch and bound algorithm for the matrix bandwidth minimization." European Journal of Operational Research 186, no. 2 (2008): 513–28. http://dx.doi.org/10.1016/j.ejor.2007.02.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

LIM, ANDREW, BRIAN RODRIGUES, and FEI XIAO. "A FAST ALGORITHM FOR BANDWIDTH MINIMIZATION." International Journal on Artificial Intelligence Tools 16, no. 03 (2007): 537–44. http://dx.doi.org/10.1142/s0218213007003394.

Full text
Abstract:
We propose a simple and direct node shifting method with hill climbing for the well-known matrix bandwidth minimization problem. Many heuristics have been developed for this NP-complete problem including the Cuthill-McKee (CM) and the Gibbs, Poole and Stockmeyer (GPS) algorithms. Recently, heuristics such as Simulated Annealing, Tabu Search and GRASP have been used, where Tabu Search and the GRASP with Path Relinking achieved significantly better solution quality than the CM and GPS algorithms. Experimentation shows that our method achieves the best solution quality when compared with these while being much faster than newly-developed algorithms.
APA, Harvard, Vancouver, ISO, and other styles
28

Zhai, Yu, Xiaoxing Fang, Kejia Ding, and Fei He. "Miniaturization Design for 8 × 8 Butler Matrix Based on Back-to-Back Bilayer Microstrip." International Journal of Antennas and Propagation 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/583903.

Full text
Abstract:
A low-cost, compact 8 × 8 Butler matrix based on a novel bilayer microstrip configuration is presented and implemented for 4.3 GHz telecommunication application. A back-to-back placed bilayer microstrip structure has been proposed to avoid using crossover. To expand operational bandwidth of the Butler matrix, a three-branch line directional coupler has been employed as 3 dB/90° bridge, and a kind of improved two-order Schiffman phase shifter has been adopted as fixed phase shifter. For application of indoor wireless communication, a compact broadband 8 × 8 Butler matrix has been designed and fabricated. The measured results show that the return loss of the matrix is lower than −10 dB, the isolation is better than 17 dB, the power distribution error is less than ±2.0 dB, the phase error is less than ±15°, and the relative bandwidth is more than 23%.
APA, Harvard, Vancouver, ISO, and other styles
29

Chagas, Guilherme Oliveira, and Sanderson L. Gonzaga de Oliveira. "Metaheuristic-based Heuristics for Symmetric-matrix Bandwidth Reduction: A Systematic Review." Procedia Computer Science 51 (2015): 211–20. http://dx.doi.org/10.1016/j.procs.2015.05.229.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Tajalli, A. "Matrix phase detector for high bandwidth and low jitter frequency synthesis." Electronics Letters 53, no. 15 (2017): 1031–33. http://dx.doi.org/10.1049/el.2017.1747.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Pop, Petrică, Oliviu Matei, and Călin-Adrian Comes. "Reducing the bandwidth of a sparse matrix with a genetic algorithm." Optimization 63, no. 12 (2013): 1851–76. http://dx.doi.org/10.1080/02331934.2013.830120.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Luo, J. C. "Algorithms for reducing the bandwidth and profile of a sparse matrix." Computers & Structures 44, no. 3 (1992): 535–48. http://dx.doi.org/10.1016/0045-7949(92)90386-e.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Yi, Xiao Su, Liang Zhang, and Ming Wang. "1394b Multi-Subnet Algorithm Based on the Theory of Queues." Applied Mechanics and Materials 556-562 (May 2014): 4109–15. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.4109.

Full text
Abstract:
The high-speed serial data bus, IEEE-1394b, is one of the most popular bus standards in avionics system, but it cannot achieve multiplexing transmission. To solve this problem, a multi-subnet partition algorithm based on the Theory of Queues (TQ) is implemented in this paper. By utilizing matrix to describe the system topology and transmission bandwidth between nodes, the algorithm can efficiently result in the minimum delay system topology. Simulation results show that the algorithm can successfully determine the topologies with minimum delay for different data transmission bandwidth matrix of the multi-network system, which are consistent with the analysis. This verifies the correctness of the algorithm.
APA, Harvard, Vancouver, ISO, and other styles
34

Wang, Ying, and Zongzhong Tian. "Efficient Original-Destination Bandwidth: A Novel Model for Arterial Traffic Signal Coordination." Journal Européen des Systèmes Automatisés 53, no. 5 (2020): 609–16. http://dx.doi.org/10.18280/jesa.530503.

Full text
Abstract:
This paper proposes an efficient origin-estimation bandwidth (OD band) model, which provides dedicated progression bands for arterial traffic based on the real-time dynamic matrix of their estimated OD pairs. The innovations of the OD band model are as follows: First, the dynamics of through and turning-in/out traffics are analyzed based on the matrix of their estimated OD pairs, and used to generate the traffic movement sequence at continuous intersections; Second, the end-time of green interval for lag-lag phase sequence at continuous intersections is determined according to the relevant constraints, the relationship between the start/end-time of green interval and the minimum/maximum green intervals; Third, the bandwidths of the two directions of the artery ware produced, after being weighted by their traffic demands. The intuitiveness, convenience, and feasibility of the OD band model were fully demonstrated through a case study. Overall, the OD band model helps to produce bi-directional progression bands for traffic with many turning movements on the artery, and enables the through and turning-in/out traffics to proceed through continuous intersections, when the signals at those intersections are green.
APA, Harvard, Vancouver, ISO, and other styles
35

Dantzer, Jean-François, Mostafa Haddani, and Philippe Robert. "ON THE STABILITY OF A BANDWIDTH PACKING ALGORITHM." Probability in the Engineering and Informational Sciences 14, no. 1 (2000): 57–79. http://dx.doi.org/10.1017/s0269964800141063.

Full text
Abstract:
The stability properties of the bandwidth allocation algorithm First Fit are analyzed for some distributions on the sizes of the requests. Fluid limits are used to get the ergodicity results. When there are two possible sizes, the description of the transient behavior involves a finite Markov chain on the exit states of a transient Markov chain on a countable state space. The explicit expression of this exit matrix is given.
APA, Harvard, Vancouver, ISO, and other styles
36

Wilhelm, Daniel. "OPTIMAL BANDWIDTH SELECTION FOR ROBUST GENERALIZED METHOD OF MOMENTS ESTIMATION." Econometric Theory 31, no. 5 (2014): 1054–77. http://dx.doi.org/10.1017/s026646661400067x.

Full text
Abstract:
A two-step generalized method of moments estimation procedure can be made robust to heteroskedasticity and autocorrelation in the data by using a nonparametric estimator of the optimal weighting matrix. This paper addresses the issue of choosing the corresponding smoothing parameter (or bandwidth) so that the resulting point estimate is optimal in a certain sense. We derive an asymptotically optimal bandwidth that minimizes a higher-order approximation to the asymptotic mean-squared error of the estimator of interest. We show that the optimal bandwidth is of the same order as the one minimizing the mean-squared error of the nonparametric plugin estimator, but the constants of proportionality are significantly different. Finally, we develop a data-driven bandwidth selection rule and show, in a simulation experiment, that it may substantially reduce the estimator’s mean-squared error relative to existing bandwidth choices, especially when the number of moment conditions is large.
APA, Harvard, Vancouver, ISO, and other styles
37

Kiefer, Nicholas M., and Timothy J. Vogelsang. "HETEROSKEDASTICITY-AUTOCORRELATION ROBUST TESTING USING BANDWIDTH EQUAL TO SAMPLE SIZE." Econometric Theory 18, no. 6 (2002): 1350–66. http://dx.doi.org/10.1017/s026646660218604x.

Full text
Abstract:
Asymptotic theory for heteroskedasticity autocorrelation consistent (HAC) covariance matrix estimators requires the truncation lag, or bandwidth, to increase more slowly than the sample size. This paper considers an alternative approach covering the case with the asymptotic covariance matrix estimated by kernel methods with truncation lag equal to sample size. Although such estimators are inconsistent, valid tests (asymptotically pivotal) for regression parameters can be constructed. The limiting distributions explicitly capture the truncation lag and choice of kernel. A local asymptotic power analysis shows that the Bartlett kernel delivers the highest power within a group of popular kernels. Finite sample simulations suggest that, regardless of the kernel chosen, the null asymptotic approximation of the new tests is often more accurate than that for conventional HAC estimators and asymptotics. Finite sample results on power show that the new approach is competitive.
APA, Harvard, Vancouver, ISO, and other styles
38

Gajewski, R. Robert, and Piotr Lompies. "Object-oriented approach to the reduction of matrix bandwidth, profile and wavefront." Advances in Engineering Software 30, no. 9-11 (1999): 783–88. http://dx.doi.org/10.1016/s0965-9978(98)00106-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Duong, Tarn, and Martin L. Hazelton. "Convergence rates for unconstrained bandwidth matrix selectors in multivariate kernel density estimation." Journal of Multivariate Analysis 93, no. 2 (2005): 417–33. http://dx.doi.org/10.1016/j.jmva.2004.04.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Sun, Song, Madhu Monga, Phillip H. Jones, and Joseph Zambreno. "An I/O Bandwidth-Sensitive Sparse Matrix-Vector Multiplication Engine on FPGAs." IEEE Transactions on Circuits and Systems I: Regular Papers 59, no. 1 (2012): 113–23. http://dx.doi.org/10.1109/tcsi.2011.2161389.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Gonzaga de Oliveira, Sanderson L., Júnior A. B. Bernardes, and Guilherme O. Chagas. "An evaluation of low-cost heuristics for matrix bandwidth and profile reductions." Computational and Applied Mathematics 37, no. 2 (2016): 1412–71. http://dx.doi.org/10.1007/s40314-016-0394-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Scott, Douglas G., and Ray P. S. Han. "Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction." Computer Methods in Applied Mechanics and Engineering 118, no. 3-4 (1994): 309–18. http://dx.doi.org/10.1016/0045-7825(94)90005-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

JI, Y., C. Y. WEN, and Z. G. LI. "IMPULSIVE SYNCHRONIZATION OF CHAOTIC SYSTEMS VIA LINEAR MATRIX INEQUALITIES." International Journal of Bifurcation and Chaos 16, no. 01 (2006): 221–27. http://dx.doi.org/10.1142/s0218127406014757.

Full text
Abstract:
Impulsive synchronization of chaotic systems is studied in this paper. By exploring the structural knowledge of the systems and using linear matrix inequalities, some less conservative conditions than existing results are derived. With the new conditions, the bound of intervals for transmitting impulses can be increased and this results in higher bandwidth efficiency. Our results are thus able to improve the efficiencies of the existing technologies on chaotic secure communications and chaotic spread communications.
APA, Harvard, Vancouver, ISO, and other styles
44

Liu, Zhao-hui, Rui Tao, Ping Luo, Xin Shu, and Guo-dong Ban. "Preparation and microwave absorbing property of carbon fiber/polyurethane radar absorbing coating." RSC Adv. 7, no. 73 (2017): 46060–68. http://dx.doi.org/10.1039/c7ra07666e.

Full text
Abstract:
To broaden the effective absorbing bandwidth, a multi-layer carbon fiber/polyurethane radar absorbing coating is prepared with carbon fiber as filler and polyurethane as matrix and the polyurethane coating as wave-transmitting layer.
APA, Harvard, Vancouver, ISO, and other styles
45

Yoon, Jungmo, and Antonio F. Galvao. "Cluster robust covariance matrix estimation in panel quantile regression with individual fixed effects." Quantitative Economics 11, no. 2 (2020): 579–608. http://dx.doi.org/10.3982/qe802.

Full text
Abstract:
This study develops cluster robust inference methods for panel quantile regression (QR) models with individual fixed effects, allowing for temporal correlation within each individual. The conventional QR standard errors can seriously underestimate the uncertainty of estimators and, therefore, overestimate the significance of effects, when outcomes are serially correlated. Thus, we propose a clustered covariance matrix (CCM) estimator to solve this problem. The CCM estimator is an extension of the heteroskedasticity and autocorrelation consistent covariance matrix estimator for QR models with fixed effects. The autocovariance element in the CCM estimator can be substantially biased, due to the incidental parameter problem. Thus, we develop a bias‐correction method for the CCM estimator. We derive an optimal bandwidth formula that minimizes the asymptotic mean squared errors, and propose a data‐driven bandwidth selection rule. We also propose two cluster robust tests, and establish their asymptotic properties. We then illustrate the practical usefulness of the proposed methods using an empirical application.
APA, Harvard, Vancouver, ISO, and other styles
46

Azad, Mohammad-Reza, Abolghasem Kamkar-Rouhani, Behzad Tokhmechi, and Mohammad Arashi. "Hierarchical simultaneous upscaling of porosity and permeability features using the bandwidth of kernel function and wavelet transformation in two dimensions: Application to the SPE-10 model." Oil & Gas Science and Technology – Revue d’IFP Energies nouvelles 76 (2021): 26. http://dx.doi.org/10.2516/ogst/2021006.

Full text
Abstract:
In this paper, two methods of kernel bandwidth and wavelet transform are used for simultaneous upscaling of two features of hydrocarbon reservoir. In the bandwidth method, the criterion for upscaling is the cell variability, and by calculating the optimal bandwidth and determining the distance matrix, the upscaling process is performed in a completely non-uniform and unregularly manner. In areas with extreme variability, the bandwidth is considered small enough to maintain the fine scale characteristics of model. Conversely in homogenous areas, with the choice of large bandwidth, the maximum rate of upscaling will occur. The bandwidth upscaling algorithm is an iterative and hierarchical algorithm. The bandwidth method, unlike conventional scale-up methods, focuses on how to upgrid cells and, by determining the optimal averaging window, we will have the least loss information for the fine scale model. Upscaling is a pre-processing to building a simulator model with lower cell number, and thus, reducing volume and computational cost, while maintaining and retaining the basic information of the fine model. Due to the various variability of the reservoir features, the attribute upscaling pattern differs, and in order to show the variability of two features in the upscaling model simultaneously, it is suggested in this paper to upscale two features simultaneously. For simultaneous upscaling, we applied two different approaches; minimum and maximum bandwidth. Moreover, wavelet transformation is applied to upscaling the model. Then, as a result, the variance of the scale-up models based on wavelet is about one-third of the variance of the bandwidth method. Simulation results show that the bandwidth method is a good approach for upscaling the heterogeneous reservoirs.
APA, Harvard, Vancouver, ISO, and other styles
47

Yin, Chao, Changsheng Xie, Jiguang Wan, Chih-Cheng Hung, Jinjiang Liu, and Yihua Lan. "BMCloud: Minimizing Repair Bandwidth and Maintenance Cost in Cloud Storage." Mathematical Problems in Engineering 2013 (2013): 1–11. http://dx.doi.org/10.1155/2013/756185.

Full text
Abstract:
To protect data in cloud storage, fault tolerance and efficient recovery become very important. Recent studies have developed numerous solutions based on erasure code techniques to solve this problem using functional repairs. However, there are two limitations to address. The first one is consistency since the Encoding Matrix (EM) is different among clouds. The other one is repairing bandwidth, which is a concern for most of us. We addressed these two problems from both theoretical and practical perspectives. We developed BMCloud, a new low repair bandwidth, low maintenance cost cloud storage system, which aims to reduce repair bandwidth and maintenance cost. The system employs both functional repair and exact repair while it inherits advantages from the both. We propose the JUDGE_STYLE algorithm, which can judge whether the system should adopt exact repair or functional repair. We implemented a networked storage system prototype and demonstrated our findings. Compared with existing solutions, BMCloud can be used in engineering to save repair bandwidth and degrade maintenance significantly.
APA, Harvard, Vancouver, ISO, and other styles
48

Hu, Jin-Xiu, Xiao-Wei Gao, Zhi-Chao Yuan, Jian Liu, and Shi-Zhang Huang. "SEBSM-Based Iterative Method for Solving Large Systems of Linear Equations and Its Applications in Engineering Computation." International Journal of Computational Methods 13, no. 05 (2016): 1650024. http://dx.doi.org/10.1142/s0219876216500249.

Full text
Abstract:
In this paper, a new iterative method, for solving sparse nonsymmetrical systems of linear equations is proposed based on the Simultaneous Elimination and Back-Substitution Method (SEBSM), and the method is applied to solve systems resulted in engineering problems solved using Finite Element Method (FEM). First, SEBSM is introduced for solving general linear systems using the direct method. And, then an iterative method based on SEBSM is presented. In the method, the coefficient matrix [Formula: see text] is split into lower, diagonally banded and upper matrices. The iterative convergence can be controlled by selecting a suitable bandwidth of the diagonally banded matrix. And the size of the working array needing to be stored in iteration is as small as the bandwidth of the diagonally banded matrix. Finally, an accelerating strategy for this iterative method is proposed by introducing a relaxation factor, which can speed up the convergence effectively if an optimal relaxation factor is chosen. Two numerical examples are given to demonstrate the behavior of the proposed method.
APA, Harvard, Vancouver, ISO, and other styles
49

Barantsev, K. A., A. N. Litvinov, and E. N. Popov. "Transport of laser emission with broadband spectrum in optically dense atomic medium under the coherent population trapping." International Journal of Modern Physics: Conference Series 41 (January 2016): 1660137. http://dx.doi.org/10.1142/s201019451660137x.

Full text
Abstract:
The paper presents a theory describing the formation of the coherent population trapping resonance for the finite laser bandwidth in an optically-dense medium of atoms inside a buffer gas cell. The equations of the atomic density matrix are established, as well as the transfer equations of laser emission spectrum inside a cell with working and buffer gas at a determined temperature. The dependence of the quality of the coherent population trapping resonance on the laser bandwidth has been studied in the case of detecting the signal of the transmitted emission and the fluorescence signal.
APA, Harvard, Vancouver, ISO, and other styles
50

Xu, Le, Rui Li, Xiaoqun Chen, Feng Wei, and Xiaowei Shi. "Wideband Frequency Invariant Array Synthesis Based on Matrix Singular Value Decomposition." Electronics 10, no. 16 (2021): 2039. http://dx.doi.org/10.3390/electronics10162039.

Full text
Abstract:
In this paper, an analytic method for frequency invariant (FI) array synthesis is proposed based on matrix singular value decomposition. By grouping the elements of FI array into a few subarrays, the FI pattern in the whole frequency band is realized. Using this algorithm, the number of sub arrays is reduced. Simulation results show that the proposed algorithm can synthesize the 64-element broadband FI array in 0.52 s. For the 18-element linear array, the half power beam width (HPBW) changes less than 0.6 degrees in the bandwidth. Moreover, the range of HPBW variation decreases rapidly along with the increase in the number of elements. Furthermore, the effectiveness of the algorithm is verified by synthesizing FI array with low side lobe level (SLL), beam scanning, and notch requirements. The examples in this paper show that the proposed algorithm can achieve better pattern characteristics with fewer elements. Finally, a broadband antenna with 2:1 bandwidth is improved, and two FI arrays of 23 elements and 64 elements are formed by using the antenna. The active pattern of the array element is introduced into the proposed algorithm, and two FI arrays synthesized by the algorithm are simulated by full wave software.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography