liu.seSearch for publications in DiVA
Endre søk
Begrens søket
12 1 - 50 of 61
Referera
Referensformat
• apa
• harvard1
• ieee
• modern-language-association-8th-edition
• vancouver
• oxford
• Annet format
Fler format
Språk
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Annet språk
Fler språk
Utmatningsformat
• html
• text
• asciidoc
• rtf
Treff pr side
• 5
• 10
• 20
• 50
• 100
• 250
Sortering
• Standard (Relevans)
• Forfatter A-Ø
• Forfatter Ø-A
• Tittel A-Ø
• Tittel Ø-A
• Type publikasjon A-Ø
• Type publikasjon Ø-A
• Eldste først
• Nyeste først
• Disputationsdatum (tidligste først)
• Disputationsdatum (siste først)
• Standard (Relevans)
• Forfatter A-Ø
• Forfatter Ø-A
• Tittel A-Ø
• Tittel Ø-A
• Type publikasjon A-Ø
• Type publikasjon Ø-A
• Eldste først
• Nyeste først
• Disputationsdatum (tidligste først)
• Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
• 1.
Department of Computer Science and Engineering, The Pennsylvania State University, USA.
Linköpings universitet, Matematiska institutionen, Beräkningsvetenskap. Linköpings universitet, Tekniska högskolan. Department of Statistics, University of Bologna, Italy.
Editorial Material: 3rd Special issue on matrix computations and statistics2010Inngår i: Computational Statistics & Data Analysis, ISSN 0167-9473, E-ISSN 1872-7352, Vol. 54, nr 12, s. 3379-3380Artikkel i tidsskrift (Annet vitenskapelig)

n/a

• 2.
Numerical Solution of Cauchy Problems for Elliptic Equations in "Rectangle-like" Geometries2005Inngår i: FEMLAB Conference,2005, Stockholm: Comsol AB , 2005Konferansepaper (Annet vitenskapelig)

We consider two dimensional inverse steady state heat conduction problems in complex geometries. The coefficients of the elliptic equation are assumed to be non-constant. Cauchy data are given on one part of the boundary and we want to find the solution in the whole domain. The problem is ill--posed in the sense that the solution does not depend continuously on the data. Using an orthogonal coordinate transformation the domain is mapped onto a rectangle. The Cauchy problem can then be solved by replacing one derivative by a bounded approximation. The resulting well--posed problem can then be solved by a method of lines. A bounded approximation of the derivative can be obtained by differentiating a cubic spline, that approximate the function in the least squares sense. This particular approximation of the derivative is computationally efficient and flexible in the sense that its easy to handle different kinds of boundary conditions. This inverse problem arises in iron production, where the walls of a melting furnace are subject to physical and chemical wear. Temperature and heat--flux data are collected by several thermocouples located inside the walls. The shape of the interface between the molten iron and the walls can then be determined by solving an inverse heat conduction problem. In our work we make extensive use of Femlab for creating test problems. By using Femlab we solve relatively complex model problems for the purpose of creating numerical test data used for validating our methods. For the types of problems we are intressted in numerical artefacts appear, near corners in the domain, in the gradients that Femlab calculates. We demonstrate why this happen and also how we deal with the problem.

• 3.
An inverse heat conduction problem and an application to heat treatment of aluminium2000Inngår i: Inverse Problems in Engineering Mechanics II / [ed] Masataka Tanaka, G.S. Dulikravich, 2000, s. 99-106Konferansepaper (Fagfellevurdert)

We consider an inverse heat conduction problem, the sideways heat equation, which is a model of a problem where one wants to determine the temperature on the surface of a body using internal measurements. The problem is ill-posed in the sense that the solution does not depend continuously on the data. We discuss the nature of the ill-posedness as well as methods for restoring stability with respect to measurement errors.

Successful heat treatment requires good control of the temperature and cooling rates during the process. In an experiment a aluminium block, of the alloy AA7010, was cooled rapidly by spraying water on one surface. Thermocouples inside the block recorded the temperature, and we demonstrate that it is possible to find the temperature distribution in the region between the thermocouple and the surface, by solving numerically the sideways heat equation.

• 4.
Numerical solution of a Cauchy problem for the Laplace equation2001Inngår i: Inverse Problems, ISSN 0266-5611, E-ISSN 1361-6420, Vol. 17, nr 4, s. 839-853Artikkel i tidsskrift (Fagfellevurdert)

We consider a two-dimensional steady state heat conduction problem. The Laplace equation is valid in a domain with a hole. Temperature and heat-flux data are specified on the outer boundary, and we wish to compute the temperature on the inner boundary. This Cauchy problem is ill-posed, i.e. the solution does not depend continuously on the boundary data, and small errors in the data can destroy the numerical solution. We consider two numerical methods for solving this problem. A standard approach is to discretize the differential equation by finite differences, and use Tikhonov regularization on the discrete problem, which leads to a large sparse least squares problem. We propose to use a conformal mapping that maps the region onto an annulus, where the equivalent problem is solved using a technique based on the fast Fourier transform. The ill-posedness is dealt with by filtering away high frequencies in the solution. Numerical results using both methods are given.

• 5.
Numerical Solution of an Inverse Steady State Heat Conduction Problem2000Konferansepaper (Annet vitenskapelig)
• 6.
Numerical Solution of Cauchy Problems for Elliptic Equations in Rectangle-like'' Geometries2005Inngår i: Proceedings for the FEMLAB Conference 2005, 2005Konferansepaper (Annet vitenskapelig)

We consider two dimensional inverse steady state heat conductionproblems in complex geometries. The coefficients of the elliptic equation are assumed to be non-constant. Cauchy data are given on onepart of the boundary and we want to find the solution in the wholedomain. The problem is ill--posed in the sense that the solution doesnot depend continuously on the data.

Using an orthogonal coordinate transformation the domain is mappedonto a rectangle. The Cauchy problem can then be solved by replacing one derivative by a bounded approximation. The resulting well--posed problem can then be solved by a method of lines. A bounded approximation of the derivative can be obtained by differentiating a cubic spline, that approximate the function in theleast squares sense. This particular approximation of the derivativeis computationally efficient and flexible in the sense that its easy to handle different kinds of boundary conditions.This inverse problem arises in iron production, where the walls of amelting furnace are subject to physical and chemical wear. Temperature and heat--flux data are collected by several thermocouples locatedinside the walls. The shape of the interface between the molten ironand the walls can then be determined by solving an inverse heatconduction problem.  In our work we make extensive use of Femlab for creating testproblems. By using FEMLAB we solve relatively complex model problems for the purpose of creating numerical test data used for validating our methods. For the types of problems we are intressted in numerical artefacts appear, near corners in the domain, in the gradients that Femlab calculates. We demonstrate why this happen and also how we deal with the problem.

• 7.
Spectral and Wavelet Methods for Solving an Inverse Heat Conduction Problem1998Inngår i: Inverse Problems in Engineering Mechanics: International Symposium on Inverse Problems in Engineering Mechanics, 1998 (ISIP 98) / [ed] M. Tanaka and G.S. Dulikravich, Oxford: Elsevier Science , 1998, s. 3-10Konferansepaper (Annet vitenskapelig)
• 8.
Linköpings universitet, Matematiska institutionen, Beräkningsvetenskap. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för konstruktions- och produktionsteknik, Mekanisk värmeteori och strömningslära. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för konstruktions- och produktionsteknik. Linköpings universitet, Tekniska högskolan.
A Comparison of Three Numerical Methods for an Inverse Heat Conduction Problem and an Industrial Application1997Konferansepaper (Annet vitenskapelig)
• 9.
Axel Ruhe 1942-20152015Inngår i: BIT Numerical Mathematics, ISSN 0006-3835, E-ISSN 1572-9125, Vol. 55, nr 3, s. 621-623Artikkel i tidsskrift (Annet vitenskapelig)

Axel Ruhe passed away April 4, 2015. He was cross-country-skiing with friends in the Swedish mountains when after 21 km he suddenly died. He is survived by his wife Gunlaug and three children from his first marriage....

• 10.
University of Copenhagen.
PLS works2009Inngår i: Journal of Chemometrics, ISSN 0886-9383, E-ISSN 1099-128X, Vol. 23, nr 1-2, s. 69-71Artikkel i tidsskrift (Fagfellevurdert)

In a recent paper, claims were made that most current implementations of PLS provide wrong and misleading residuals [1]. In this paper the relation between PLS and Lanczos bidiagonalization is described and it is shown that there is a good rationale behind current implementations of PLS. Most importantly, the residuals determined in current implementations of PLS are independent of the scores used for predicting the dependent variable(s). Oppositely, in the newly suggested approach, the residuals are correlated to the scores and hence may be high due to variation that is actually used for predicting. It is concluded that the current practice of calculating residuals be maintained.

• 11. Domeij Bäckryd, Rebecka
Simulation of heat transfer on a gas sensor component2005Inngår i: FEMLAB Conference,2005, Stockholm: Comsol AB , 2005, s. 177-181Konferansepaper (Annet vitenskapelig)

Gas sensors are used in many different application areas. As many gas sensor components are battery heated, one major limit of the operation time is the power dissipated as heat. The aim of this work has been to simulate the heat transfer on a hydrogen gas sensor component. Modelling and simulations have been performed in FEMLAB. The partial differential equation with boundary conditions was solved and the solution was validated against experimental data. Convection increases with the increase of hydrogen concentration. A great effort was made to find a model for the convection. When the simulations were compared to experiments, it turned out that the theoretical convection model was insufficient to describe this small system involving hydrogen, which was an unexpected but interesting result.

• 12.
Matrix methods in data mining and pattern recognition2007Annet (Annet (populærvitenskap, debatt, mm))
• 13.
Multi-linear mappings, SVD, HOSVD, and the numerical solution of ill-conditioned tensor least squares problems2005Inngår i: Second Workshop on Tensor Decompositions and Applications TDA05,2005, 2005Konferansepaper (Annet vitenskapelig)
• 14.
Numerical Linear Algebra and Applications in Data Mining and IT2003Annet (Annet (populærvitenskap, debatt, mm))
• 15.
Numerical linear algebra in data mining2006Inngår i: Acta Numerica, ISSN 0962-4929, E-ISSN 1474-0508, Vol. 15, s. 327-384Artikkel, forskningsoversikt (Fagfellevurdert)

Ideas and algorithms from numerical linear algebra are important in several areas of data mining. We give an overview of linear algebra methods in text mining (information retrieval), pattern recognition (classification of handwritten digits), and Page Rank computations for web search engines. The emphasis is on rank reduction as a method of extracting information from a data matrix, low-rank approximation of matrices using the singular value decomposition and clustering, and on eigenvalue methods for network analysis. © Cambridge University Press, 2006.

• 16.
Numerical Solution of Cauchy Problems for Elliptic PDE's in ComplexGeometries2003Inngår i: Applied Inverse Problems,2003, 2003Konferansepaper (Annet vitenskapelig)
• 17.
Numerical Solution of Cauchy Problems for Elliptic PDE's in ComplexGeometries2003Inngår i: Conference on Numerical Analysis,2003, 2003Konferansepaper (Annet vitenskapelig)
• 18.
Solving quadratically constrained least squares problems using a differential-geometric approach2002Inngår i: BIT Numerical Mathematics, ISSN 0006-3835, E-ISSN 1572-9125, Vol. 42, nr 2, s. 323-335Artikkel i tidsskrift (Fagfellevurdert)

A quadratically constrained linea least squares problem is usually solved using a Lagrange multiplier for the constraint and then solving iteratively a nonlinear secular equation for the optimal Lagrange multiplier. It is well-known that, due to the closeness to a pole for the secular equation, standard methods for solving the secular equation can be slow, and sometimes it is not easy to select a good starting value for the iteration. The problem can be reformulated as that of minimizing the residual of the least squares problem on the unit sphere. Using a differential-geometric approach we formulate Newton's method on the sphere, and thereby avoid the difficulties associated with the Lagrange multiplier formulation. This Newton method on the sphere can be implemented efficiently, and since it is easy to find a good starting value for the iteration, and the convergence is often quite fast, it has a clear advantage over the Lagrange multiplier method. A numerical example is given.

• 19.
The Eigenvalues of the Google Matrix2004Rapport (Annet vitenskapelig)
• 20.
The Maximum Likelihood Estimate in Reduced-Rank Regression2003Inngår i: Numerical Linear Algebra and its Applications,2003, 2003Konferansepaper (Annet vitenskapelig)
• 21.
A stability estimate for a Cauchy problem for an elliptic partial differential equation2005Inngår i: Inverse Problems, ISSN 0266-5611, E-ISSN 1361-6420, Vol. 21, nr 5, s. 1643-1653Artikkel i tidsskrift (Fagfellevurdert)

A two-dimensional inverse steady state heat conduction problem in the unit square is considered. Cauchy data are given for y ≤ 0, and boundary data are for x ≤ 0 and x ≤ 1. The elliptic operator is self-adjoint with non-constant, smooth coefficients. The solution for y ≤ 1 is sought. This Cauchy problem is ill-posed in an L2-setting. A stability functional is defined, for which a differential inequality is derived. Using this inequality a stability result of Hölder type is proved. It is demonstrated explicitly how the stability depends on the smoothness of the coefficients. The results can also be used for rectangle-like regions that can be mapped conformally onto a rectangle. © 2005 IOP Publishing Ltd.

• 22.
Linköpings universitet, Matematiska institutionen. Linköpings universitet, Tekniska högskolan. Institute of Mathematics, Polish Academy of Sciences, Warsaw, Poland.
Wavelet and Fourier methods for solving the sideways heat equation2000Inngår i: SIAM Journal on Scientific Computing, ISSN 1064-8275, E-ISSN 1095-7197, Vol. 21, nr 6, s. 2187-2205Artikkel i tidsskrift (Fagfellevurdert)

We consider an inverse heat conduction problem, the sideways heat equation, which is a model of a problem, where one wants to determine the temperature on both sides of a thick wall, but where one side is inaccessible to measurements. Mathematically it is formulated as a Cauchy problem for the heat equation in a quarter plane, with data given along the line x = 1, where the solution is wanted for 0 ≤ x < 1.

The problem is ill-posed, in the sense that the solution (if it exists) does not depend continuously on the data. We consider stabilizations based on replacing the time derivative in the heat equation by wavelet-based approximations or a Fourier-based approximation. The resulting problem is an initial value problem for an ordinary differential equation, which can be solved by standard numerical methods, e.g., a Runge–Kutta method.

We discuss the numerical implementation of Fourier and wavelet methods for solving the sideways heat equation. Theory predicts that the Fourier method and a method based on Meyer wavelets will give equally good results. Our numerical experiments indicate that also a method based on Daubechies wavelets gives comparable accuracy. As test problems we take model equations with constant and variable coefficients. We also solve a problem from an industrial application with actual measured data.

• 23.
Minimization of linear functionals defined on solutions of large-scale discrete Ill-posed problems2005Inngår i: BIT Numerical Mathematics, ISSN 0006-3835, E-ISSN 1572-9125, Vol. 45, nr 2, s. 329-340Artikkel i tidsskrift (Fagfellevurdert)

The minimization of linear functionals defined on the solutions of discrete ill-posed problems arises, e.g., in the computation of confidence intervals for these solutions. In 1990, Eldén proposed an algorithm for this minimization problem based on a parametric programming reformulation involving the solution of a sequence of trust-region problems, and using matrix factorizations. In this paper, we describe MLFIP, a large-scale version of this algorithm where a limited-memory trust-region solver is used on the subproblems. We illustrate the use of our algorithm in connection with an inverse heat conduction problem.

• 24.
Introduction to Numerical Computation2004Bok (Annet (populærvitenskap, debatt, mm))
• 25.
Matrix rank reduction for data analysis and feature extraction2006Inngår i: Handbook Parallel Computing and Statistics / [ed] Haesun Park and Lars Eldén, Boca Raton: CRC Press , 2006, s. 415-447Kapittel i bok, del av antologi (Annet vitenskapelig)

Numerical techniques for data analysis and feature extraction are discussed using the framework of matrix rank reduction. The singular value decomposition (SVD) and its properties are reviewed, and the relation to Latent Semantic Indexing (LSI) and Principal Component Analysis (PCA) is described. Methods that approximate the SVD are reviewed. A few basic methods for linear regression, in particular the Partial Least Squares (PLS) method, arepresented, and analyzed as rank reduction methods. Methods for feature extraction, based on centroids and the classical Linear Discriminant Analysis (LDA), as well as an improved LDA based on the generalized singular value decomposition (LDA/GSVD) are described. The effectiveness of these methods are illustrated using examples from information retrieval, and 2 dimensional representation of clustered data.

• 26.
Pattern Recognition using Higher Order SVD2005Inngår i: 3rd IASC world conference onComputational Statistics and Data Analysis,2005, 2005Konferansepaper (Annet vitenskapelig)
• 27.
The Maximum likelihood estimate in reduced-rank regression2003Rapport (Annet vitenskapelig)
• 28.
The maximum likelihood estimate in reduced-rank regression2005Inngår i: Numerical Linear Algebra with Applications, ISSN 1070-5325, E-ISSN 1099-1506, Vol. 12, nr 8, s. 731-741Artikkel i tidsskrift (Fagfellevurdert)

In previous work by Stoica and Viberg the reduced-rank regression problem is solved in a maximum likelihood sense. The present paper proposes an alternative numerical procedure. The solution is written in terms of the principal angles between subspaces spanned by the data matrices. It is demonstrated that the solution is meaningful also in the case when the maximum likelihood criterion is not valid. A numerical example is given. Copyright (c) 2005 John Wiley & Sons, Ltd.

• 29.
Computing Frechet derivatives in partial least squares regression2015Inngår i: Linear Algebra and its Applications, ISSN 0024-3795, E-ISSN 1873-1856, Vol. 473, s. 316-338Artikkel i tidsskrift (Fagfellevurdert)

Partial least squares is a common technique for multivariate regression. The pro- cedure is recursive and in each step basis vectors are computed for the explaining variables and the solution vectors. A linear model is fitted by projection onto the span of the basis vectors. The procedure is mathematically equivalent to Golub-Kahan bidiagonalization, which is a Krylov method, and which is equiv- alent to a pair of matrix factorizations. The vectors of regression coefficients and prediction are non-linear functions of the right hand side. An algorithm for computing the Frechet derivatives of these functions is derived, based on perturbation theory for the matrix factorizations. From the Frechet derivative of the prediction vector one can compute the number of degrees of freedom, which can be used as a stopping criterion for the recursion. A few numerical examples are given.

• 30.
Editorial Material: Preface in BIT NUMERICAL MATHEMATICS, vol 57, issue 1, pp2017Inngår i: BIT Numerical Mathematics, ISSN 0006-3835, E-ISSN 1572-9125, Vol. 57, nr 1Artikkel i tidsskrift (Annet vitenskapelig)

n/a

• 31.
Editorial Material: Preface to BIT 55:4 in BIT NUMERICAL MATHEMATICS, vol 55, issue 4, pp 897-8992015Inngår i: BIT Numerical Mathematics, ISSN 0006-3835, E-ISSN 1572-9125, Vol. 55, nr 4, s. 897-899Artikkel i tidsskrift (Annet vitenskapelig)

n/a

• 32.
Partial least-squares vs. Lanczos bidiagonalization—I: analysis of a projection method for multiple regression2004Inngår i: Computational Statistics & Data Analysis, ISSN 0167-9473, E-ISSN 1872-7352, Vol. 46, nr 1, s. 11-31Artikkel i tidsskrift (Fagfellevurdert)

Multiple linear regression is considered and the partial least-squares method (PLS) for computing a projection onto a lower-dimensional subspace is analyzed. The equivalence of PLS to Lanczos bidiagonalization is a basic part of the analysis. Singular value analysis, Krylov subspaces, and shrinkage factors are used to explain why, in many cases, PLS gives a faster reduction of the residual than standard principal components regression. It is also shown why in some cases the dimension of the subspace, given by PLS, is not as small as desired.

• 33.
Preface to BIT 56:4 in BIT NUMERICAL MATHEMATICS2016Inngår i: BIT Numerical Mathematics, ISSN 0006-3835, E-ISSN 1572-9125, Vol. 56, nr 4, s. 1163-1164Artikkel i tidsskrift (Annet vitenskapelig)

n/a

• 34.
Skolkovo Inst Sci and Technol Skoltech, Russia.
Solving bilinear tensor least squares problems and application to Hammerstein identification2019Inngår i: Numerical Linear Algebra with Applications, ISSN 1070-5325, E-ISSN 1099-1506, Vol. 26, nr 2, artikkel-id e2226Artikkel i tidsskrift (Fagfellevurdert)

Bilinear tensor least squares problems occur in applications such as Hammerstein system identification and social network analysis. A linearly constrained problem of medium size is considered, and nonlinear least squares solvers of Gauss-Newton-type are applied to numerically solve it. The problem is separable, and the variable projection method can be used. Perturbation theory is presented and used to motivate the choice of constraint. Numerical experiments with Hammerstein models and random tensors are performed, comparing the different methods and showing that a variable projection method performs best.

Fulltekst tilgjengelig fra 2019-12-10 11:40
• 35.
Tufts University. University of Maryland.
Updating and Downdating Matrix Decompositions2010Inngår i: Selected Works of G. W. Stewart with Commentaries / [ed] M. Kilmer and D. O'Öeary, Boston: Birkhäuser , 2010, s. 45-58Kapittel i bok, del av antologi (Annet vitenskapelig)

Published in honor of his 70th birthday, this volume explores and celebrates the work of G.W. (Pete) Stewart, a world-renowned expert in computational linear algebra. This volume includes: forty-four of Stewart's most influential research papers in two subject areas: matrix algorithms, and rounding and perturbation theory; a biography of Stewart; a complete list of his publications, students, and honors; selected photographs; and commentaries on his works in collaboration with leading experts in the field. G.W. Stewart: Selected Works with Commentaries will appeal to graduate students, practitioners, and researchers in computational linear algebra and the history of mathematics.

• 36.
Linköpings universitet, Institutionen för datavetenskap, Interaktiva och kognitiva system. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, Interaktiva och kognitiva system. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Beräkningsmatematik. Linköpings universitet, Tekniska högskolan.
Computing Semantic Clusters by Semantic Mirroring and Spectral Graph Partitioning2013Inngår i: Mathematics in Computer Science, ISSN 1661-8270, Vol. 7, s. 293-313Artikkel i tidsskrift (Fagfellevurdert)

Using the technique of semantic mirroring a graph is obtained that represents words and their translationsfrom a parallel corpus or a bilingual lexicon. The connectedness of the graph holds information about the semanticrelations of words that occur in the translations. Spectral graph theory is used to partition the graph, which leadsto a grouping of the words in different clusters. We illustrate the method using a small sample of seed words froma lexicon of Swedish and English adjectives and discuss its application to computational lexical semantics andlexicography.

• 37.
A Newton-Grassmann method for computing the best multilinear rank-(r1,r2,r3) approximation of a tensor2009Inngår i: SIAM Journal on Matrix Analysis and Applications, ISSN 0895-4798, Vol. 32, nr 2, s. 248-271Artikkel i tidsskrift (Fagfellevurdert)

We derive a Newton method for computing the best rank-$(r_1,r_2,r_3)$ approximation of a given $J\times K\times L$ tensor $\mathcal{A}$. The problem is formulated as an approximation problem on a product of Grassmann manifolds. Incorporating the manifold structure into Newton's method ensures that all iterates generated by the algorithm are points on the Grassmann manifolds. We also introduce a consistent notation for matricizing a tensor, for contracted tensor products and some tensor-algebraic manipulations, which simplify the derivation of the Newton equations and enable straightforward algorithmic implementation. Experiments show a quadratic convergence rate for the Newton–Grassmann algorithm.

• 38.
Perturbation Theory and Optimality Conditions for the Best Multilinear Rank Approximation of a Tensor2011Inngår i: SIAM Journal on Matrix Analysis and Applications, ISSN 0895-4798, E-ISSN 1095-7162, Vol. 32, nr 4, s. 1422-1450Artikkel i tidsskrift (Fagfellevurdert)

The problem of computing the best rank-(p,q,r) approximation of a third order tensor is considered. First the problem is reformulated as a maximization problem on a product of three Grassmann manifolds. Then expressions for the gradient and the Hessian are derived in a local coordinate system at a stationary point, and conditions for a local maximum are given. A first order perturbation analysis is performed using the Grassmann manifold framework. The analysis is illustrated in a few examples, and it is shown that the perturbation theory for the singular value decomposition is a special case of the tensor theory.

• 39.
University of Bologna.
A numerical solution of a Cauchy problem for an elliptic equation by Krylov subspaces2009Inngår i: INVERSE PROBLEMS, ISSN 0266-5611 , Vol. 25, nr 6, s. 065002-Artikkel i tidsskrift (Fagfellevurdert)

We study the numerical solution of a Cauchy problem for a self-adjoint elliptic partial differential equation u(zz) - L-u = 0 in three space dimensions (x, y, z), where the domain is cylindrical in z. Cauchy data are given on the lower boundary and the boundary values on the upper boundary are sought. The problem is severely ill-posed. The formal solution is written as a hyperbolic cosine function in terms of the two-dimensional elliptic operator L (via its eigenfunction expansion), and it is shown that the solution is stabilized (regularized) if the large eigenvalues are cut off. We suggest a numerical procedure based on the rational Krylov method, where the solution is projected onto a subspace generated using the operator L-1. This means that in each Krylov step, a well-posed two-dimensional elliptic problem involving L is solved. Furthermore, the hyperbolic cosine is evaluated explicitly only for a small symmetric matrix. A stopping criterion for the Krylov recursion is suggested based on the relative change of an approximate residual, which can be computed very cheaply. Two numerical examples are given that demonstrate the accuracy of the method and the efficiency of the stopping criterion.

• 40.
Department of Mathematics, University of Bologna.
SOLVING ILL-POSED LINEAR SYSTEMS WITH GMRES AND A SINGULAR PRECONDITIONER2012Inngår i: SIAM Journal on Matrix Analysis and Applications, ISSN 0895-4798, E-ISSN 1095-7162, Vol. 33, s. 1369-1394Artikkel i tidsskrift (Fagfellevurdert)

Almost singular linear systems arise in discrete ill-posed problems. Either because ofthe intrinsic structure of the problem or because of preconditioning, the spectrum of the coefficientmatrix is often characterized by a sizable gap between a large group of numerically zero eigenvaluesand the rest of the spectrum. Correspondingly, the right-hand side has leading eigencomponentsassociated with the eigenvalues away from zero. In this paper the effect of this setting in theconvergence of the generalized minimal residual (GMRES) method is considered. It is shown thatin the initial phase of the iterative algorithm, the residual components corresponding to the largeeigenvalues are reduced in norm, and these can be monitored without extra computation. Theanalysis is supported by numerical experiments. In particular, ill-posed Cauchy problems for partialdifferential equations with variable coefficients are considered, where the preconditioner is a fast,low-rank solver for the corresponding problem with constant coefficients.

• 41.
Open Univ, England.
Semi-sparse PCA2019Inngår i: Psychometrika, ISSN 0033-3123, E-ISSN 1860-0980, Vol. 84, nr 1, s. 164-185Artikkel i tidsskrift (Fagfellevurdert)

It is well known that the classical exploratory factor analysis (EFA) of data with more observations than variables has several types of indeterminacy. We study the factor indeterminacy and show some new aspects of this problem by considering EFA as a specific data matrix decomposition. We adopt a new approach to the EFA estimation and achieve a new characterization of the factor indeterminacy problem. A new alternative model is proposed, which gives determinate factors and can be seen as a semi-sparse principal component analysis (PCA). An alternating algorithm is developed, where in each step a Procrustes problem is solved. It is demonstrated that the new model/algorithm can act as a specific sparse PCA and as a low-rank-plus-sparse matrix decomposition. Numerical examples with several large data sets illustrate the versatility of the new model, and the performance and behaviour of its algorithmic implementation.

Fulltekst tilgjengelig fra 2019-11-27 10:48
• 42. Fagerlund, Martin
Linköpings universitet, Institutionen för datavetenskap, NLPLAB - Laboratoriet för databehandling av naturligt språk. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Beräkningsvetenskap. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, NLPLAB - Laboratoriet för databehandling av naturligt språk. Linköpings universitet, Tekniska högskolan.
Computing Word Senses by Semantic Mirroring and Spectral Graph Partitioning2010Inngår i: Proceedings of TextGraphs-5 - 2010 Workshop on Graph-based Methods for Natural Language Processing / [ed] Carmen Banea, Alessandro Moschitti, Swapna Somasundaran and Fabio Massimo Zanzotto, Stroudsburg, PA, USA: The Association for Computational Linguistics , 2010, s. 103-107Konferansepaper (Fagfellevurdert)

Using the technique of ”semantic mirroring”a graph is obtained that representswords and their translations from a parallelcorpus or a bilingual lexicon. The connectednessof the graph holds informationabout the different meanings of words thatoccur in the translations. Spectral graphtheory is used to partition the graph, whichleads to a grouping of the words accordingto different senses. We also report resultsfrom an evaluation using a small sample ofseed words from a lexicon of Swedish andEnglish adjectives.

• 43.
Xidian University, Xi'an, China .
Solving a Cauchy problem for a 3D elliptic PDE with variable coefficients by a quasi-boundary-value method2014Inngår i: Inverse Problems, ISSN 0266-5611, E-ISSN 1361-6420, Vol. 30, nr 1, s. 015005-Artikkel i tidsskrift (Fagfellevurdert)

An ill-posed Cauchy problem for a 3D elliptic partial differential equation with variable coefficients is considered. A well-posed quasi-boundary-value (QBV) problem is given to approximate it. Some stability estimates are given. For the numerical implementation, a large sparse system is obtained from discretizing the QBV problem using the finite difference method. A left-preconditioned generalized minimum residual method is used to solve the large system effectively. For the preconditioned system, a fast solver using the fast Fourier transform is given. Numerical results show that the method works well.

• 44.
Lanzhou University.
A quasi-boundary-value method for the Cauchy problem for elliptic equations with  nonhomogeneous Neumann data2010Inngår i: Journal of Inverse and Ill-Posed Problems, ISSN 0928-0219, E-ISSN 1569-3945, Vol. 18, nr 6, s. 617-645Artikkel i tidsskrift (Fagfellevurdert)

A Cauchy problem for elliptic equations with nonhomogeneous Neumann datain a cylindrical domain is investigated in this paper. For the theoretical aspect the a-prioriand a-posteriori parameter choice rules are suggested and the corresponding error estimatesare obtained. About the numerical aspect, for a simple case results given by twomethods based on the discrete Sine transform and the finite difference method are presented;an idea of left-preconditioned GMRES (Generalized Minimum Residual) methodis proposed to deal with the high dimensional case to save the time; a view of dealingwith a general domain is suggested. Some ill-posed problems regularized by the quasiboundary-value method are listed and some rules of this method are suggested.

• 45.
Lanzhou University.
﻿﻿Stability and regularization of a backward parabolic PDE with variable coefficients2010Inngår i: Journal of Inverse and Ill-Posed Problems, ISSN 0928-0219, E-ISSN 1569-3945, Vol. 18, s. 217-243Artikkel i tidsskrift (Fagfellevurdert)

We consider a backward parabolic partial differential equation (BPPDE) withvariable coefficient a.x; t / in time. A new modification is used on the logarithmic convexitymethod to obtain a conditional stability estimate. Based on a formal solution, wereveal the essence of the ill-posedness and propose a simple regularization method. Moreover,we apply the regularization method to two representative cases. The results of boththeoretical and numerical performance show the validity of our method.

• 46.
Uppsala Univ, Sweden.
Preface2018Inngår i: BIT Numerical Mathematics, ISSN 0006-3835, E-ISSN 1572-9125, Vol. 58, nr 1Artikkel i tidsskrift (Annet vitenskapelig)

n/a

• 47. Lundstrom, E.
Adaptive eigenvalue computations using Newton's method on the Grassmann manifold2002Inngår i: SIAM Journal on Matrix Analysis and Applications, ISSN 0895-4798, E-ISSN 1095-7162, Vol. 23, nr 3, s. 819-839Artikkel i tidsskrift (Fagfellevurdert)

We consider the problem of updating an invariant subspace of a large and structured Hermitian matrix when the matrix is modified slightly. The problem can be formulated as that of computing stationary values of a certain function with orthogonality constraints. The constraint is formulated as the requirement that the solution must be on the Grassmann manifold, and Newton's method on the manifold is used. In each Newton iteration a Sylvester equation is to be solved. We discuss the properties of the Sylvester equation and conclude that for large problems preconditioned iterative methods can be used. Preconditioning techniques are discussed. Numerical examples from signal subspace computations are given in which the matrix is Toeplitz and we compute a partial singular value decomposition corresponding to the largest singular values. Further we solve numerically the problem of computing the smallest eigenvalues and corresponding eigenvectors of a large sparse matrix that has been slightly modified.

• 48.
Linköpings universitet, Institutionen för teknik och naturvetenskap, Visuell informationsteknologi och applikationer. Linköpings universitet, Tekniska högskolan.
Linköpings universitet, Institutionen för teknik och naturvetenskap, Visuell informationsteknologi och applikationer. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Beräkningsvetenskap. Linköpings universitet, Tekniska högskolan.
Numerical Analysis of BRDFs for Inverse Rendering2009Rapport (Annet vitenskapelig)

The properties of materials which are present in a scene determine how geometry reflects and distributes light in the scene. This text presents work-in-progress on numerical analysis of bidirectional reflection distribution functions (BRDF) corresponding to various materials, with a focus on inverse rendering. An analysis of these functions is vital for the understanding of the behaviour of reflected light under different lighting conditions, and in the application of inverse rendering, it is important in order to determine what quality one can expect from recovered data. We discuss the singular value decompositions of a few materials, their effect on the ill-posedness of the inverse problem related to the reflectance equation and how regularization affects the solution of the problem.

• 49.
Univ Minnesota, Dept Comp Sci & Engn, Minneapolis, MN 55455 USA Linkoping Univ, Dept Math, S-58183 Linkoping, Sweden.
Schur-type methods for solving least squares problems with Toeplitz structure2000Inngår i: SIAM Journal on Scientific Computing, ISSN 1064-8275, E-ISSN 1095-7197, Vol. 22, nr 2, s. 406-430Artikkel i tidsskrift (Fagfellevurdert)

We give an overview of fast algorithms for solving least squares problems with Toeplitz structure, based on generalization of the classical Schur algorithm, and discuss their stability properties. In order to obtain more accurate triangular factors of a Toeplitz matrix as well as accurate solutions for the least squares problems, methods based on corrected seminormal equations (CSNE) can be used. We show that the applicability of the generalized Schur algorithm is considerably enhanced when the algorithm is used in conjunction with CSNE. Several numerical tests are reported, where different variants of the generalized Schur algorithm and CSNE are compared for their accuracy and speed.

• 50.
Numerical analysis of an ill-posed Cauchy problem for a convection - Diffusion equation2007Inngår i: Inverse Problems in Science and Engineering, ISSN 1741-5977, E-ISSN 1741-5985, Vol. 15, nr 3, s. 191-211Artikkel i tidsskrift (Fagfellevurdert)

The mathematical and numerical properties of an ill-posed Cauchy problem for a convection - diffusion equation are investigated in this study. The problem is reformulated as a Volterra integral equation of the first kind with a smooth kernel. The rate of decay of the singular values of the integral operator determines the degree of ill-posedness. The purpose of this article is to study how the convection term influences the degree of ill-posedness by computing numerically the singular values. It is also shown that the sign of the coefficient in the convection term determines the rate of decay of the singular values. Some numerical examples are also given to illustrate the theory.

12 1 - 50 of 61
Referera
Referensformat
• apa
• harvard1
• ieee
• modern-language-association-8th-edition
• vancouver
• oxford
• Annet format
Fler format
Språk
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Annet språk
Fler språk
Utmatningsformat
• html
• text
• asciidoc
• rtf