On the Lanczos and Golub-Kahan reduction methods applied to discrete ill-posed problems

2015 ◽  
Vol 23 (1) ◽  
pp. 187-204 ◽  
Author(s):  
Silvia Gazzola ◽  
Enyinda Onunwor ◽  
Lothar Reichel ◽  
Giuseppe Rodriguez
Keyword(s):  
Reduction Methods ◽  
Ill Posed

scholarly journals On the block Lanczos and block Golub–Kahan reduction methods applied to discrete ill‐posed problems

2021 ◽  
Author(s):  
Abdulaziz Alqahtani ◽  
Silvia Gazzola ◽  
Lothar Reichel ◽  
Giuseppe Rodriguez
Keyword(s):  
Reduction Methods ◽  
Ill Posed ◽  
Block Lanczos

Information and estimation in image processing

1987 ◽  
Vol 45 ◽  
pp. 14-17
Author(s):  
B. Roy Frieden
Keyword(s):  
Image Processing ◽  
Optical System ◽  
Large Amplitude ◽  
Communication Theory ◽  
Image Data ◽  
Direct Approach ◽  
Ill Posed

Despite the skill and determination of electro-optical system designers, the images acquired using their best designs often suffer from blur and noise. The aim of an “image enhancer” such as myself is to improve these poor images, usually by digital means, such that they better resemble the true, “optical object,” input to the system. This problem is notoriously “ill-posed,” i.e. any direct approach at inversion of the image data suffers strongly from the presence of even a small amount of noise in the data. In fact, the fluctuations engendered in neighboring output values tend to be strongly negative-correlated, so that the output spatially oscillates up and down, with large amplitude, about the true object. What can be done about this situation? As we shall see, various concepts taken from statistical communication theory have proven to be of real use in attacking this problem. We offer below a brief summary of these concepts.

Speech Emotion Recognition Based on Sparse Representation

2013 ◽  
Vol 38 (4) ◽  
pp. 465-470 ◽  
Author(s):  
Jingjie Yan ◽  
Xiaolan Wang ◽  
Weiyi Gu ◽  
LiLi Ma
Keyword(s):  
Dimensionality Reduction ◽  
Emotion Recognition ◽  
Least Squares ◽  
Partial Least Squares ◽  
Partial Least Squares Regression ◽  
Speech Emotion Recognition ◽  
Least Squares Regression ◽  
Computer Science Pedagogy ◽  
Reduction Methods ◽  
Analysis Computer

Abstract Speech emotion recognition is deemed to be a meaningful and intractable issue among a number of do- mains comprising sentiment analysis, computer science, pedagogy, and so on. In this study, we investigate speech emotion recognition based on sparse partial least squares regression (SPLSR) approach in depth. We make use of the sparse partial least squares regression method to implement the feature selection and dimensionality reduction on the whole acquired speech emotion features. By the means of exploiting the SPLSR method, the component parts of those redundant and meaningless speech emotion features are lessened to zero while those serviceable and informative speech emotion features are maintained and selected to the following classification step. A number of tests on Berlin database reveal that the recogni- tion rate of the SPLSR method can reach up to 79.23% and is superior to other compared dimensionality reduction methods.

THE NEW ALGORITHM OF SOLVING HARMONIC BALANCE EQUATIONS

2019 ◽  
Author(s):  
Vladimir Lantsov ◽  
A. Papulina
Keyword(s):  
Harmonic Balance ◽  
Model Order Reduction ◽  
Order Reduction ◽  
Balance Equations ◽  
Model Order ◽  
Cad Systems ◽  
Computational Costs ◽  
Reduction Methods ◽  
Model Equations

The new algorithm of solving harmonic balance equations which used in electronic CAD systems is presented. The new algorithm is based on implementation to harmonic balance equations the ideas of model order reduction methods. This algorithm allows significantly reduce the size of memory for storing of model equations and reduce of computational costs.

Sufficient reduction methods for multivariate surveillance

2011 ◽  
Vol 4 (0) ◽  
Author(s):  
Sawaporn Siripanthana ◽  
Eleanor Stillman
Keyword(s):  
Reduction Methods ◽  
Sufficient Reduction
Sign in / Sign up

Export Citation Format

Share Document