liu.seSök publikationer i DiVA
Ändra sökning
Avgränsa sökresultatet
1234567 1 - 50 av 557
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Abbas, Qaisar
    Uppsala universitet, Avdelningen för teknisk databehandling.
    Weak Boundary and Interface Procedures for Wave and Flow Problems2011Doktorsavhandling, monografi (Övrigt vetenskapligt)
    Abstract [en]

    In this thesis, we have analyzed the accuracy and stability aspects of weak boundary and interface conditions (WBCs) for high order finite difference methods on Summations-By-Parts (SBP) form. The numerical technique has been applied to wave propagation and flow problems.

    The advantage of WBCs over strong boundary conditions is that stability of the numerical scheme can be proven. The boundary procedures in the advection-diffusion equation for a boundary layer problem is analyzed. By performing Navier-Stokes calculations, it is shown that most of the conclusions from the model problem carries over to the fully nonlinear case.

    The work was complemented to include the new idea of using WBCs on multiple grid points in a region, where the data is known, instead of at a single point. It was shown that we can achieve high accuracy, an increased rate of convergence to steady-state and non-reflecting boundary conditions by using this approach.

    Using the SBP technique and WBCs, we have worked out how to construct conservative and energy stable hybrid schemes for shocks using two different approaches. In the first method, we combine a high order finite difference scheme with a second order MUSCL scheme. In the second method, a procedure to locally change the order of accuracy of the finite difference schemes is developed. The main purpose is to obtain a higher order accurate scheme in smooth regions and a low order non-oscillatory scheme in the vicinity of shocks.

    Furthermore, we have analyzed the energy stability of the MUSCL scheme, by reformulating the scheme in the framework of SBP and artificial dissipation operators. It was found that many of the standard slope limiters in the MUSCL scheme do not lead to a negative semi-definite dissipation matrix, as required to get pointwise stability.

    Finally, high order simulations of shock diffracting over a convex wall with two facets were performed. The numerical study is done for a range of Reynolds numbers. By monitoring the velocities at the solid wall, it was shown that the computations were resolved in the boundary layer. Schlieren images from the computational results were obtained which displayed new interesting flow features.

  • 2.
    Abbas, Qaisar
    et al.
    Uppsala universitet, Avdelningen för teknisk databehandling.
    Nordström, Jan
    Uppsala universitet, Avdelningen för teknisk databehandling.
    Weak versus strong no-slip boundary conditions for the Navier-Stokes equations2010Ingår i: Engineering Applications of Computational Fluid Mechanics, ISSN 1994-2060, Vol. 4, s. 29-38Artikel i tidskrift (Refereegranskat)
  • 3.
    Abbas, Qaisar
    et al.
    Uppsala universitet, Avdelningen för teknisk databehandling.
    Nordström, Jan
    Uppsala universitet, Avdelningen för teknisk databehandling.
    Weak versus Strong No-Slip Boundary Conditions for the Navier-Stokes Equations2008Ingår i: Proc. 6th South African Conference on Computational and Applied Mechanics, South African Association for Theoretical and Applied Mechanics , 2008, s. 52-62Konferensbidrag (Övrigt vetenskapligt)
  • 4.
    Abbas, Qaisar
    et al.
    Uppsala universitet, Avdelningen för teknisk databehandling.
    van der Weide, Edwin
    Nordström, Jan
    Uppsala universitet, Avdelningen för teknisk databehandling.
    Accurate and stable calculations involving shocks using a new hybrid scheme2009Ingår i: Proc. 19th AIAA CFD Conference, AIAA , 2009Konferensbidrag (Refereegranskat)
  • 5.
    Abbas, Qaisar
    et al.
    Uppsala universitet, Avdelningen för teknisk databehandling.
    van der Weide, Edwin
    Faculty of Engineering Technology, University of Twente, AE Enschede, The Netherlands.
    Nordström, Jan
    Uppsala universitet, Avdelningen för teknisk databehandling.
    Energy Stability of the MUSCL Scheme2010Ingår i: Proc. 7th South African Conference on Computational and Applied Mechanics, South African Association for Theoretical and Applied Mechanics , 2010, s. 65:1-8Konferensbidrag (Övrigt vetenskapligt)
  • 6.
    Abbas, Qaisar
    et al.
    Uppsala universitet, Avdelningen för teknisk databehandling.
    van der Weide, Edwin
    Nordström, Jan
    Uppsala universitet, Avdelningen för teknisk databehandling.
    Energy stability of the MUSCL scheme2010Ingår i: Numerical Mathematics and Advanced Applications: 2009, Berlin: Springer-Verlag , 2010, s. 61-68Konferensbidrag (Refereegranskat)
  • 7.
    Abdulla, Parosh Aziz
    et al.
    Uppsala Univ, Sweden.
    Atig, Mohamed Faouzi
    Uppsala Univ, Sweden.
    Chen, Yu-Fang
    Acad Sinica, Taiwan.
    Phi Diep, Bui
    Uppsala Univ, Sweden.
    Holik, Lukas
    Brno Univ Technol, Czech Republic.
    Rezine, Ahmed
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Rummer, Philipp
    Uppsala Univ, Sweden.
    TRAU : SMT solver for string constraints2018Ingår i: PROCEEDINGS OF THE 2018 18TH CONFERENCE ON FORMAL METHODS IN COMPUTER AIDED DESIGN (FMCAD), IEEE , 2018, s. 165-169Konferensbidrag (Refereegranskat)
    Abstract [en]

    We introduce TRAU, an SMT solver for an expressive constraint language, including word equations, length constraints, context-free membership queries, and transducer constraints. The satisfiability problem for such a class of constraints is in general undecidable. The key idea behind TRAU is a technique called flattening, which searches for satisfying assignments that follow simple patterns. TRAU implements a Counter-Example Guided Abstraction Refinement (CEGAR) framework which contains both an under- and an over-approximation module. The approximations are refined in an automatic manner by information flow between the two modules. The technique implemented by TRAU can handle a rich class of string constraints and has better performance than state-of-the-art string solvers.

  • 8.
    Adib Yaghmaie, Farnaz
    et al.
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten. Nanyang Technol Univ, Singapore.
    Movric, Kristian Hengster
    Czech Tech Univ, Czech Republic.
    Lewis, Frank L.
    Univ Texas Arlington, TX 76019 USA; Northeastern Univ, Peoples R China.
    Su, Rong
    Nanyang Technol Univ, Singapore.
    Differential graphical games for H-infinity control of linear heterogeneous multiagent systems2019Ingår i: International Journal of Robust and Nonlinear Control, ISSN 1049-8923, E-ISSN 1099-1239, Vol. 29, nr 10, s. 2995-3013Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Differential graphical games have been introduced in the literature to solve state synchronization problem for linear homogeneous agents. When the agents are heterogeneous, the previous notion of graphical games cannot be used anymore and a new definition is required. In this paper, we define a novel concept of differential graphical games for linear heterogeneous agents subject to external unmodeled disturbances, which contain the previously introduced graphical game for homogeneous agents as a special case. Using our new formulation, we can solve both the output regulation and H-infinity output regulation problems. Our graphical game framework yields coupled Hamilton-Jacobi-Bellman equations, which are, in general, impossible to solve analytically. Therefore, we propose a new actor-critic algorithm to solve these coupled equations numerically in real time. Moreover, we find an explicit upper bound for the overall L2-gain of the output synchronization error with respect to disturbance. We demonstrate our developments by a simulation example.

  • 9.
    Altafini, Claudio
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten.
    The Geometric Phase of Stock Trading2016Ingår i: PLoS ONE, ISSN 1932-6203, E-ISSN 1932-6203, Vol. 11, nr 8, s. e0161538-Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Geometric phases describe how in a continuous-time dynamical system the displacement of a variable (called phase variable) can be related to other variables (shape variables) undergoing a cyclic motion, according to an area rule. The aim of this paper is to show that geometric phases can exist also for discrete-time systems, and even when the cycles in shape space have zero area. A context in which this principle can be applied is stock trading. A zero-area cycle in shape space represents the type of trading operations normally carried out by high-frequency traders (entering and exiting a position on a fast time-scale), while the phase variable represents the cash balance of a trader. Under the assumption that trading impacts stock prices, even zero-area cyclic trading operations can induce geometric phases, i.e., profits or losses, without affecting the stock quote.

  • 10.
    Amsallem, David
    et al.
    Department of Aeronautics and Astronautics, Stanford University, Stanford, CA 94305-4035, USA.
    Nordström, Jan
    Linköpings universitet, Matematiska institutionen, Beräkningsmatematik. Linköpings universitet, Tekniska fakulteten.
    Energy Stable Model Reduction of Neurons by Non-negative Discrete Empirical Interpolation2016Ingår i: SIAM Journal on Scientific Computing, ISSN 1064-8275, E-ISSN 1095-7197, Vol. 38, nr 2, s. B297-B326Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The accurate and fast prediction of potential propagation in neuronal networks is of prime importance in neurosciences. This work develops a novel structure-preserving model reduction technique to address this problem based on Galerkin projection and nonnegative operator approximation. It is first shown that the corresponding reduced-order model is guaranteed to be energy stable, thanks to both the structure-preserving approach that constructs a distinct reduced-order basis for each cable in the network and the preservation of nonnegativity. Furthermore, a posteriori error estimates are provided, showing that the model reduction error can be bounded and controlled. Finally, the application to the model reduction of a large-scale neuronal network underlines the capability of the proposed approach to accurately predict the potential propagation in such networks while leading to important speedups.

  • 11.
    Amsallem, David
    et al.
    Department of Aeronautics and Astronautics, Stanford University, USA.
    Nordström, Jan
    Linköpings universitet, Matematiska institutionen, Beräkningsmatematik. Linköpings universitet, Tekniska högskolan.
    High-order accurate difference schemes for the Hodgkin-Huxley equations2013Ingår i: Journal of Computational Physics, ISSN 0021-9991, E-ISSN 1090-2716, Vol. 252, s. 573-590Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    A novel approach for simulating potential propagation in neuronal branches with high accuracy is developed. The method relies on high-order accurate difference schemes using the Summation-By-Parts operators with weak boundary and interface conditions applied to the Hodgkin–Huxley equations. This work is the first demonstrating high accuracy for that equation. Several boundary conditions are considered including the non-standard one accounting for the soma presence, which is characterized by its own partial differential equation. Well-posedness for the continuous problem as well as stability of the discrete approximation is proved for all the boundary conditions. Gains in terms of CPU times are observed when high-order operators are used, demonstrating the advantage of the high-order schemes for simulating potential propagation in large neuronal trees.

  • 12.
    Andersson Granberg, Tobias
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska högskolan.
    Norin, Anna
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska högskolan.
    Värbrand, Peter
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska högskolan.
    Yuan, Di
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska högskolan.
    Integrating optimization and simulation to gain more efficient airport logistics2009Ingår i: Eighth USA/Europe Air Traffic Management Research and Development Seminar (ATM2009), 2009, s. 1-10Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper we present airport logistics, which is a framework of resource management in the air transportation system. Focus is on the processes supporting turn-around. A detailed simulation model of various processes involved in turn-around is developed, by which the interaction between these processes are analyzed. We show that integrating optimization and simulation is a powerful tool to demonstrate efficiency improvements in airport logistics, using scheduling de-icing trucks as an example. An optimization algorithm for scheduling de-icing trucks is developed and simulations are performed comparing different schedules. The schedule obtained when considering total airport performance in the optimization algorithm gives minimum flight delay and waiting times in the simulations.

  • 13.
    Andersson, Henrik
    Linköpings universitet, Institutionen för teknik och naturvetenskap. Linköpings universitet, Tekniska högskolan.
    Coordinated Routing: applications in location and inventory management2006Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    Almost everywhere, routing plays an important role in everyday life. This thesis consists of three parts, each studying different applications where routing decisions are coordinated with other decisions. A common denominator in all applications is that an intelligent utilization of a fleet of vehicles is crucial for the performance of the system. In the first part, routing and inventorymanagement decisions are coordinated, in the second part, routing decisions concerning different modes of transportation are coordinated with inventory management, and in the third part, location decision and routing are coordinated.

    In the first part, an application concerning waste management is presented. Many industries generate garbage, and instead of handling the waste disposal themselves, other companies, specialized in garbage collection, handle the disposal. Each industry rents containers from a company to be used for waste, and the garbage collection companies handle the collection. The industries buy a service including one or more containers at the industry and the garbage collection companies are obliged to make sure that the containers never become overfull. The idea is that the industries buy this service and in return, the garbage collection company can plan the collection so that the overall cost and the number of overfull containers is minimized. Two models for the problem facing the garbage collection company are proposed. The first is solved using a Lagrangean relaxation approach on a flow based model, and the second is solved using Benders decomposition on a column based model.

    The second part investigates a distribution chain management problem taken from the Swedish pulp industry. Given fixed production plans at the mills, and fixed customer demands, the problem is to minimize the distribution cost. Unlike many other models for marine distribution chains, the customers are not located at the harbors. This means that the model proposed also incorporates the distribution planning from the harbors to the customers. All customers are not served from the harbors; some are served directly from the mills using trucks and trains to distribute the pulp, and these decisions are also included. The problem is modeled as a mixed integer linear program and solved using a branch and price scheme. Due to the complexity of the problem, the solution strategy is divided into two phases, where the first emphasizes the generation of schedules for the vessels operated by the company, while the second deals with the chartering of vessels on the spot market.

    In the third part, routing is combined with location decisions in the location-routing problem. Special emphasis is given to strategic management where decision makers must make location, capacity and routing decisions over a long planning period. The studied application comes fromstrategic schoolmanagement, where the location and capacity of the schools as well as their catchment areas are under consideration. The problem is modeled as a mixed integer linear program. The computational study shows the importance of incorporating

    a routing component allowing multiple visits, as well as the danger of having a too short planning period.

    Delarbeten
    1. A Lagrangean Based Heuristic for the Inventory Routing Problem
    Öppna denna publikation i ny flik eller fönster >>A Lagrangean Based Heuristic for the Inventory Routing Problem
    2006 (Engelska)Ingår i: European Journal of Operational Research, ISSN 0377-2217Artikel i tidskrift (Refereegranskat) Submitted
    Nationell ämneskategori
    Teknik och teknologier
    Identifikatorer
    urn:nbn:se:liu:diva-13900 (URN)
    Tillgänglig från: 2006-07-12 Skapad: 2006-07-12
    2. A pseudo Benders Decomposition Approach
    Öppna denna publikation i ny flik eller fönster >>A pseudo Benders Decomposition Approach
    2002 (Engelska)Ingår i: Proceedings of Nordic MPS ’02, 2002Konferensbidrag, Publicerat paper (Övrigt vetenskapligt)
    Nationell ämneskategori
    Teknik och teknologier
    Identifikatorer
    urn:nbn:se:liu:diva-13901 (URN)
    Tillgänglig från: 2006-07-12 Skapad: 2006-07-12
    3. A Distribution Chain Management Problem in the Swedish Pulp Industry
    Öppna denna publikation i ny flik eller fönster >>A Distribution Chain Management Problem in the Swedish Pulp Industry
    2006 (Engelska)Artikel i tidskrift (Refereegranskat) Submitted
    Nationell ämneskategori
    Teknik och teknologier
    Identifikatorer
    urn:nbn:se:liu:diva-13902 (URN)
    Tillgänglig från: 2006-07-12 Skapad: 2006-07-12
    4. Decision Support for Distribution Chain Management: the Swedish Pulp Industry
    Öppna denna publikation i ny flik eller fönster >>Decision Support for Distribution Chain Management: the Swedish Pulp Industry
    2004 (Engelska)Ingår i: 7th International Conference on Intelligent Transport Systems, 2004, s. 1051-1056Konferensbidrag, Publicerat paper (Övrigt vetenskapligt)
    Nationell ämneskategori
    Teknik och teknologier
    Identifikatorer
    urn:nbn:se:liu:diva-13903 (URN)
    Tillgänglig från: 2006-07-12 Skapad: 2006-07-12 Senast uppdaterad: 2009-04-23
    5. Location-Routing Problems: An Annotated Bibliography
    Öppna denna publikation i ny flik eller fönster >>Location-Routing Problems: An Annotated Bibliography
    2006 (Engelska)Artikel i tidskrift (Refereegranskat) Submitted
    Nationell ämneskategori
    Teknik och teknologier
    Identifikatorer
    urn:nbn:se:liu:diva-13904 (URN)
    Tillgänglig från: 2006-07-12 Skapad: 2006-07-12
    6. The Relocation-Routing Problem
    Öppna denna publikation i ny flik eller fönster >>The Relocation-Routing Problem
    2006 (Engelska)Artikel i tidskrift (Refereegranskat) Submitted
    Nationell ämneskategori
    Teknik och teknologier
    Identifikatorer
    urn:nbn:se:liu:diva-13905 (URN)
    Tillgänglig från: 2006-07-12 Skapad: 2006-07-12
  • 14.
    Andersson, Lars-Erik
    et al.
    Linköpings universitet, Matematiska institutionen, Matematik och tillämpad matematik. Linköpings universitet, Tekniska högskolan.
    Pinto da Costa, A.
    University of Lisbon, Portugal.
    Agwa, M. A.
    Zagazig University, Egypt.
    Existence and uniqueness for frictional incremental and rate problems - sharp critical bounds2016Ingår i: Zeitschrift für angewandte Mathematik und Mechanik, ISSN 0044-2267, E-ISSN 1521-4001, Vol. 96, nr 1, s. 78-105Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We investigate frictional contact problems for discrete linear elastic structures, in particular the quasistatic incremental problem and the rate problem. It is shown that sharp conditions on the coefficients of friction for unique solvability of these problems are the same. We also give explicit expressions of these critical bounds by using a method of optimization. For the case of two spatial dimensions the conditions are formulated as a huge set of non symmetric eigenvalue problem. A computer program for solving these problems was designed and used to compute the critical bounds for some structures of relative small size, some of which appeared in the literature. The results of a variety of numerical experiments with uniform and non uniform distributions of the frictional properties are presented. (C) 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim

  • 15.
    Andersson, Mats
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Burdakov, Oleg
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Knutsson, Hans
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Zikrin, Spartak
    Linköpings universitet, Matematiska institutionen, Matematik och tillämpad matematik. Linköpings universitet, Tekniska högskolan.
    Global search strategies for solving multilinear least-squares problems2012Ingår i: Sultan Qaboos University Journal for Science, ISSN 1027-524X, Vol. 17, nr 1, s. 12-21Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The multilinear least-squares (MLLS) problem is an extension of the linear leastsquares problem. The difference is that a multilinear operator is used in place of a matrix-vector product. The MLLS is typically a large-scale problem characterized by a large number of local minimizers. It originates, for instance, from the design of filter networks. We present a global search strategy that allows for moving from one local minimizer to a better one. The efficiency of this strategy is illustrated by results of numerical experiments performed for some problems related to the design of filter networks.

  • 16.
    Andersson, Mats
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Burdakov, Oleg
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Knutsson, Hans
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Zikrin, Spartak
    Linköpings universitet, Matematiska institutionen. Linköpings universitet, Tekniska högskolan.
    Global Search Strategies for Solving Multilinear Least-squares Problems2011Rapport (Övrigt vetenskapligt)
    Abstract [en]

    The multilinear least-squares (MLLS) problem is an extension of the linear least-squares problem. The difference is that a multilinearoperator is used in place of a matrix-vector product. The MLLS istypically a large-scale problem characterized by a large number of local minimizers. It originates, for instance, from the design of filter networks. We present a global search strategy that allows formoving from one local minimizer to a better one. The efficiencyof this strategy isillustrated by results of numerical experiments performed forsome problems related to the design of filter networks.

  • 17.
    Andersson, Mats
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik. Linköpings universitet, Tekniska högskolan.
    Burdakov, Oleg
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Knutsson, Hans
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Zikrin, Spartak
    Linköpings universitet, Matematiska institutionen. Linköpings universitet, Tekniska högskolan.
    Sparsity Optimization in Design of Multidimensional Filter Networks2013Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Filter networks is a powerful tool used for reducing the image processing time, while maintaining its reasonably high quality.They are composed of sparse sub-filters whose low sparsity ensures fast image processing.The filter network design is related to solvinga sparse optimization problem where a cardinality constraint bounds above the sparsity level.In the case of sequentially connected sub-filters, which is the simplest network structure of those considered in this paper, a cardinality-constrained multilinear least-squares (MLLS) problem is to be solved. If to disregard the cardinality constraint, the MLLS is typically a large-scale problem characterized by a large number of local minimizers. Each of the local minimizers is singular and non-isolated.The cardinality constraint makes the problem even more difficult to solve.An approach for approximately solving the cardinality-constrained MLLS problem is presented.It is then applied to solving a bi-criteria optimization problem in which both thetime and quality of image processing are optimized. The developed approach is extended to designing filter networks of a more general structure. Its efficiency is demonstrated by designing certain 2D and 3D filter networks. It is also compared with the existing approaches.

  • 18.
    Andersson, Mats
    et al.
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Burdakov, Oleg
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Knutsson, Hans
    Linköpings universitet, Institutionen för medicinsk teknik, Medicinsk informatik. Linköpings universitet, Tekniska högskolan.
    Zikrin, Spartak
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Sparsity Optimization in Design of Multidimensional Filter Networks2015Ingår i: Optimization and Engineering, ISSN 1389-4420, E-ISSN 1573-2924, Vol. 16, nr 2, s. 259-277Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Filter networks are used as a powerful tool used for reducing the image processing time and maintaining high image quality.They are composed of sparse sub-filters whose high sparsity ensures fast image processing.The filter network design is related to solvinga sparse optimization problem where a cardinality constraint bounds above the sparsity level.In the case of sequentially connected sub-filters, which is the simplest network structure of those considered in this paper, a cardinality-constrained multilinear least-squares (MLLS) problem is to be solved. Even when disregarding the cardinality constraint, the MLLS is typically a large-scale problem characterized by a large number of local minimizers, each of which is singular and non-isolated.The cardinality constraint makes the problem even more difficult to solve.

    An approach for approximately solving the cardinality-constrained MLLS problem is presented.It is then applied to solving a bi-criteria optimization problem in which both thetime and quality of image processing are optimized. The developed approach is extended to designing filter networks of a more general structure. Its efficiency is demonstrated by designing certain 2D and 3D filter networks. It is also compared with the existing approaches.

  • 19.
    Andersson, Per-Åke
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Multi-year maintenance optimisation for paved public roads - segment based modelling and price-directive decomposition2007Doktorsavhandling, monografi (Övrigt vetenskapligt)
    Abstract [sv]

    I avhandlingen studeras hur kostnadseffektiva underhålls- (uh-)planer för belagd väg kan genereras, på basis av information om aktuellt vägytetillstånd och funktionella modeller för kostnads- och tillståndsförändringar, delvis utvecklade i samarbete med svenska Vägverket (VV). Tilltänkt användning är på strategisk och programnivå, innan mer detaljerad objektinformation finns att tillgå. Till skillnad från hittills använda modeller, så genereras individuella uh-planer för varje vägsegment (en homogen vägsträcka vad gäller aktuellt beläggningstillstånd och beläggningshistorik), i kontinuerliga tillstånds- och åtgärdsrum. Genom användning av Lagrangerelaxerande optimeringsteknik, så kan de speciella nytto/kostnads-kvot-villkor som VV ålägger varje uh-objekt naturligen hanteras med dualpriser för budgetvillkoren. Antalet vägsegment som konkurrerar om budgetmedlen är vanligtvis stort. Data från VV:s Vägdatabank för Värmland har använts, omfattande ca 9000 vägsegment. Genom den stora datamängden har datorprogrammen implementerats för parallellbearbetning. Under avhandlingsarbetet har projektet beviljats tillgång till Monolith PCklustret vid NSC. För att kunna reducera optimeringskörtiderna har modell- och metodutveckling varit nödvändig. Genom att aggregera vägsegmenten till vägklasser har goda startvärden på dualpriserna erhållits. Genom utvecklingen av en speciell restvärdesrutin har den explicit behandlade tidsperioden kunnat reduceras. Vid lösandet av det duala subproblemet har speciell uppmärksamhet ägnats åt de diskretiseringseffekter som uppstår i metoden dynamisk programmering. En typ av tillämpning avser ett delvägnät, exempelvis en väg. Valideringsstudier har genomförts på väg 63 i Värmland – med lovande men inte tillfredsställande resultat (se nedan). En speciell modell för samordnat uh beaktar stordriftsfördelarna vid samtidig åtgärd på en hel vägsträcka. Den andra huvudtypen av studier gäller ett helt nätverk. Flera metodtyper har tillämpats, både för att lösa de relaxerade optimeringsproblemen och för att generera uhplaner som uppfyller budgetvillkoren. För en anständig diskretisering är körtiderna för hela Värmland mindre än 80 CPU-timmar. Genom en a posteriori primal heuristik reduceras kraven på parallellbearbetning till ett litet PC-kluster. Avhandlingen studerar vidare effekterna av omfördelade budgetmedel samt en övergång till en transparent, stokastisk modell – vilka båda visar små avvikelser från basmodellen.

    Optimeringsresultaten för Värmland indikerar att budgetnivåer på ca 40% av Värmlands verkliga uh-budget är tillräckliga. Dock saknas viktiga kostnadsdrivande faktorer i denna första modellomgång, exempelvis vissa funktionella prestanda (säkerhet), all miljöpåverkande prestanda (buller etc.) och strukturell prestanda (ex.vis bärighet, som enbart modelleras via ett åldersmått). För ökad tilltro till PMS i allmänhet och optimering i synnerhet, bör avvikelserna analyseras ytterligare och leda till förbättringar vad gäller tillståndsmätning, tillståndseffekt- & kostnadsmodellering samt matematisk modellering & implementering.

  • 20.
    Anistratov, Pavel
    Linköpings universitet, Institutionen för systemteknik, Fordonssystem. Linköpings universitet, Tekniska fakulteten.
    Computation of Autonomous Safety Maneuvers Using Segmentation and Optimization2019Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    This thesis studies motion planning for future autonomous vehicles with main focus on passenger cars. By having automatic steering and braking together with information about the environment, such as other participants in the traffic or obstacles, it would be possible to perform autonomous maneuvers while taking limitations of the vehicle and road–tire interaction into account. Motion planning is performed to find such maneuvers that bring the vehicle from the current state to a desired future state, here by formulating the motion-planning problem as an optimal control problem. There are a number of challenges for such an approach to motion planning; some of them are how to formulate the criterion in the motion planning (objective function in the corresponding optimal control problem), and how to make the solution of motion-planning problems efficient to be useful in online applications. These challenges are addressed in this thesis.

    As a criterion for motion-planning problems of passenger vehicles on doublelane roads, it is investigated to use a lane-deviation penalty function to capture the observation that it is dangerous to drive in the opposing lane, but safe to drive in the original lane after the obstacle. The penalty function is augmented with certain additional terms to address also the recovery behavior of the vehicle. The resulting formulation is shown to provide efficient and steady maneuvers and gives a lower time in the opposing lane compared to other objective functions. Under varying parameters of the scenario formulation, the resulting maneuvers are changing in a way that exhibits structured characteristics.

    As an approach to improve efficiency of computations for the motion-planning problem, it is investigated to segment motion planning of the full maneuver into several smaller maneuvers. A way to extract segments is considered from a vehicle dynamics point of view, and it is based on extrema of the vehicle orientation and the yaw rate. The segmentation points determined using this approach are observed to allow efficient splitting of the optimal control problem for the full maneuver into subproblems.

    Having a method to segment maneuvers, this thesis further studies methods to allow parallel computation of these maneuvers. One investigated method is based on Lagrange relaxation and duality decomposition. Smaller subproblems are formulated, which are governed by solving a low-complexity coordination problem. Lagrangian relaxation is performed on a subset of the dynamic constraints at the segmentation points, while the remaining variables are predicted. The prediction is possible because of the observed structured characteristics resulting from the used lane-deviation penalty function. An alternative approach is based on adoption of the alternating augmented Lagrangian method. Augmentation of the Lagrangian allows to apply relaxation for all dynamic constraints at the segmentation points, and the alternating approach makes it possible to decompose the full problem into subproblems and coordinating their solutions by analytically solving an overall coordination problem. The presented decomposition methods allow computation of maneuvers with high correspondence and lower computational times compared to the results obtained for solving the full maneuver in one step.

    Delarbeten
    1. Segmentation and Merging of Autonomous At-the-Limit Maneuvers for Ground Vehicles
    Öppna denna publikation i ny flik eller fönster >>Segmentation and Merging of Autonomous At-the-Limit Maneuvers for Ground Vehicles
    2018 (Engelska)Ingår i: Proceedings of the 14th International Symposium on Advanced Vehicle Control, Beijing, July 16-20, 2018, 2018, s. 1-6Konferensbidrag, Publicerat paper (Refereegranskat)
    Abstract [en]

    To decrease the complexity of motion-planning optimizations, a segmentation and merging strategy for maneuvers is proposed. Maneuvers that are at-the-limit of friction are of special interest since they appear in many critical situations. The segmentation pointsare used to set constraints for several smaller optimizations for parts of the full maneuver, which later are merged and compared withoptimizations of the full maneuver. The technique is illustrated for a double lane-change maneuver.

    Nyckelord
    vehicle automation and control, ground vehicle motion-planning, aggressive maneuvers
    Nationell ämneskategori
    Reglerteknik
    Identifikatorer
    urn:nbn:se:liu:diva-152222 (URN)
    Konferens
    The 14th International Symposium on Advanced Vehicle Control, Beijing, July 16-20, 2018
    Tillgänglig från: 2018-10-22 Skapad: 2018-10-22 Senast uppdaterad: 2019-11-21Bibliografiskt granskad
    2. Efficient Motion Planning for Autonomous Vehicle Maneuvers Using Duality-Based Decomposition
    Öppna denna publikation i ny flik eller fönster >>Efficient Motion Planning for Autonomous Vehicle Maneuvers Using Duality-Based Decomposition
    2019 (Engelska)Ingår i: IFAC PAPERSONLINE, ELSEVIER , 2019, Vol. 52, nr 5, s. 78-84Konferensbidrag, Publicerat paper (Refereegranskat)
    Abstract [en]

    A method to decompose a motion-planning problem into several segments is presented. It is based on a modification of the original problem, such that certain variables at the splitting points are considered to be precomputed and thus fixed and the remaining variables are obtained by performing Lagrange relaxation. The resulting dual problem is split into several subproblems, allowing parallel computation. The method is formalized as a computational algorithm and evaluated in a safety critical double lane-change situation. The resulting maneuver has close-to-optimal behavior and, for certain initialization strategies, it is obtained in shorter computational time compared to computing the full maneuver in one step. (C) 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

    Ort, förlag, år, upplaga, sidor
    ELSEVIER, 2019
    Nyckelord
    trajectory and path planning; autonomous vehicles; duality-based decomposition; motion control; safety; intelligent transportation systems
    Nationell ämneskategori
    Beräkningsmatematik
    Identifikatorer
    urn:nbn:se:liu:diva-161215 (URN)10.1016/j.ifacol.2019.09.013 (DOI)000486629500014 ()
    Konferens
    9th IFAC International Symposium on Advances in Automotive Control (AAC)
    Anmärkning

    Funding Agencies|Wallenberg AI, Autonomous Systems and Software Program (WASP) - Knut and Alice Wallenberg Foundation

    Tillgänglig från: 2019-10-25 Skapad: 2019-10-25 Senast uppdaterad: 2019-11-21
  • 21.
    Anistratov, Pavel
    et al.
    Linköpings universitet, Institutionen för systemteknik, Fordonssystem. Linköpings universitet, Tekniska fakulteten.
    Olofsson, Björn
    Linköpings universitet, Institutionen för systemteknik, Fordonssystem. Linköpings universitet, Tekniska fakulteten. Lund Univ, Sweden.
    Nielsen, Lars
    Linköpings universitet, Institutionen för systemteknik, Fordonssystem. Linköpings universitet, Tekniska fakulteten.
    Efficient Motion Planning for Autonomous Vehicle Maneuvers Using Duality-Based Decomposition2019Ingår i: IFAC PAPERSONLINE, ELSEVIER , 2019, Vol. 52, nr 5, s. 78-84Konferensbidrag (Refereegranskat)
    Abstract [en]

    A method to decompose a motion-planning problem into several segments is presented. It is based on a modification of the original problem, such that certain variables at the splitting points are considered to be precomputed and thus fixed and the remaining variables are obtained by performing Lagrange relaxation. The resulting dual problem is split into several subproblems, allowing parallel computation. The method is formalized as a computational algorithm and evaluated in a safety critical double lane-change situation. The resulting maneuver has close-to-optimal behavior and, for certain initialization strategies, it is obtained in shorter computational time compared to computing the full maneuver in one step. (C) 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

  • 22.
    Arndt, Carl-Fredrik
    Linköpings universitet, Matematiska institutionen, Beräkningsvetenskap.
    Energy estimates and variance estimation for hyperbolic stochastic partial differentialequations2011Självständigt arbete på avancerad nivå (yrkesexamen), 30 poäng / 45 hpStudentuppsats (Examensarbete)
    Abstract [en]

    In this thesis the connections between the boundary conditions and the vari- ance of the solution to a stochastic partial differential equation (PDE) are investigated. In particular a hyperbolical system of PDE’s with stochastic initial and boundary data are considered. The problem is shown to be well- posed on a class of boundary conditions through the energy method. Stability is shown by using summation-by-part operators coupled with simultaneous- approximation-terms. By using the energy estimates, the relative variance of the solutions for different boundary conditions are analyzed. It is concluded that some types of boundary conditions yields a lower variance than others. This is verified by numerical computations.

  • 23.
    Arnlind, Joakim
    et al.
    Department of Mathematics, Royal Institute of Technology, 100 44, Stockholm, Sweden .
    Bordemann, Martin
    Laboratoire de MIA, 4 rue des Frères Lumière, Univ. deHaute-Alsace, 68093, Mulhouse, France .
    Hoppe, Jens
    Department of Mathematics, Royal Institute of Technology, 100 44, Stockholm, Sweden .
    Lee, Choonkyu
    Department of Physics and Center for Theoretical Physics, Seoul National University, 151-747, Seoul, South Korea .
    Goldfish Geodesics and Hamiltonian Reduction of Matrix Dynamics2008Ingår i: Letters in Mathematical Physics, ISSN 0377-9017, E-ISSN 1573-0530, Vol. 84, s. 89-98Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We describe the Hamiltonian reduction of a time-dependent real-symmetric N×N matrix system to free vector dynamics, and also provide a geodesic interpretation of Ruijsenaars–Schneider systems. The simplest of the latter, the goldfish equation, is found to represent a flat-space geodesic in curvilinear coordinates.

  • 24.
    Arnlind, Joakim
    et al.
    Linköpings universitet, Matematiska institutionen, Matematik och tillämpad matematik. Linköpings universitet, Tekniska fakulteten.
    Choe, Jaigyoung
    Korea Institute Adv Study, South Korea.
    Hoppe, Jens
    Royal Institute Technology, Sweden.
    Noncommutative Minimal Surfaces2016Ingår i: Letters in Mathematical Physics, ISSN 0377-9017, E-ISSN 1573-0530, Vol. 106, nr 8, s. 1109-1129Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We define noncommutative minimal surfaces in the Weyl algebra, and give a method to construct them by generalizing the well-known Weierstrass representation.

  • 25.
    Arnlind, Joakim
    et al.
    Linköpings universitet, Matematiska institutionen, Matematik och tillämpad matematik. Linköpings universitet, Tekniska fakulteten.
    Holm, Christoffer
    Linköpings universitet, Matematiska institutionen. Linköpings universitet, Tekniska fakulteten.
    A noncommutative catenoid2018Ingår i: Letters in Mathematical Physics, ISSN 0377-9017, E-ISSN 1573-0530, Vol. 108, nr 7, s. 1601-1622Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    A noncommutative algebra corresponding to the classical catenoid is introduced together with a differential calculus of derivations. We prove that there exists a unique metric and torsion-free connection that is compatible with the complex structure, and the curvature is explicitly calculated. A noncommutative analogue of the fact that the catenoid is a minimal surface is studied by constructing a Laplace operator from the connection and showing that the embedding coordinates are harmonic. Furthermore, an integral is defined and the total curvature is computed. Finally, classes of left and right modules are introduced together with constant curvature connections, and bimodule compatibility conditions are discussed in detail.

  • 26.
    Arnlind, Joakim
    et al.
    Department of Mathematics, Royal Institute of Technology, Stockholm, 100 44, Sweden .
    Hoppe, Jens
    Department of Mathematics, Royal Institute of Technology, Stockholm, 100 44, Sweden .
    EIGENVALUE DYNAMICS, FOLLYTONS AND LARGEN LIMITS OF MATRICES2006Ingår i: Applications of Random Matrices in Physics / [ed] Édouard Brézin, Vladimir Kazakov, Didina Serban, Paul Wiegmann, Anton Zabrodin, Springer, 2006, 211, s. 89-94Kapitel i bok, del av antologi (Refereegranskat)
    Abstract [en]

    How do the eigenvalues of a “free” hermitian N × N matrix X(t) evolve in time? The answer is provided by the rational Calogero-Moser systems [5, 13] if (!) the initial conditions are chosen such that i[X(0),Ẋ(0)] has a non-zero eigenvalue of multiplicity N–1; for generic X(0),Ẋ(0) the question remained unanswered for 30 years.

  • 27.
    Arnlind, Joakim
    et al.
    Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden.
    Hoppe, Jens
    Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden.
    Eigenvalue-Dynamics off the Calogero–Moser System2004Ingår i: Letters in Mathematical Physics, ISSN 0377-9017, E-ISSN 1573-0530, Vol. 68, s. 121-129Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    By finding N(N− 1)/2 suitable conserved quantities, free motions of real symmetric N×N matrices X(t), with arbitrary initial conditions, are reduced to nonlinear equations involving only the eigenvalues of X – in contrast to the rational Calogero-Moser system, for which [X(0),Xd(0)] has to be purely imaginary, of rank one.

  • 28.
    Arnlind, Joakim
    et al.
    Department of Mathematics, Royal Institute of Technology, 10044 Stockholm, Sweden.
    Hoppe, Jens
    Department of Mathematics, Royal Institute of Technology, 10044 Stockholm, Sweden.
    Theisen, Stefan
    Albert-Einstein-Institut, Am Mühlenberg 1, D-14476 Golm, Germany.
    Spinning membranes2004Ingår i: Physics Letters B, ISSN 0370-2693, E-ISSN 1873-2445, Vol. 599, nr 1-2, s. 118-128Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We present new solutions of the classical equations of motion of bosonic (matrix-)membranes. Those relating to minimal surfaces in spheres provide spinning membrane solutions in AdSp×SqAdSp×Sq, as well as in flat space–time. Nontrivial reductions of the BMN matrix model equations are also given.

  • 29.
    Arnlind, Joakim
    et al.
    Mathematical Physics, Royal Institute of Technology, SE-106 91, Stockholm, Sweden .
    Mickelsson, Jouko
    Mathematical Physics, Royal Institute of Technology, SE-106 91, Stockholm, Sweden .
    Trace Extensions, Determinant Bundles, and Gauge Group Cocycles2002Ingår i: Letters in Mathematical Physics, ISSN 0377-9017, E-ISSN 1573-0530, Vol. 62, nr 2, s. 101-110Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We study the geometry of determinant line bundles associated with Dirac operators on compact odd-dimensional manifolds. Physically, these arise as (local) vacuum line bundles in quantum gauge theory. We give a simplified derivation of the commutator anomaly formula using a construction based on noncyclic trace extensions and associated nonmultiplicative renormalized determinants.

  • 30.
    Aronsson, Gunnar
    Linköpings universitet, Matematiska institutionen, Matematik och tillämpad matematik. Linköpings universitet, Tekniska högskolan.
    On Production Planning and Activity Periods2015Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Consider a company which produces and sells a certain product on a market with highly variable demand. Since the demand is very high during some periods, the company will produce and create a stock in advance before these periods. On the other hand it costs money to hold a big stock, so that some balance is needed for optimum. The demand is assumed to be known in advance with sufficient accuracy. We use a technique from optimal control theory for the analysis, which leads to so-called activity periods. During such a period the stock is positive and the production is maximal, provided that the problem starts with zero stock, which is the usual case. Over a period of one or more years, there will be a few activity periods. Outside these periods the stock is zero and the policy is to choose production = the smaller of [demand, maximal production]. The “intrinsic time length” is a central concept. It is simply the maximal time a unit of the product can be stored before selling without creating a loss.

  • 31.
    Aronsson, Gunnar
    Linköpings universitet, Matematiska institutionen, Matematik och tillämpad matematik. Linköpings universitet, Tekniska högskolan.
    Production planning, activity periods and passivity periods2015Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Consider a company which produces and sells a certain product on a market with highly variable demand. Since the demand is very high during some periods, the company will produce and create a stock in advance before these periods. On the other hand it costs money to hold a big stock, so that some balance is needed for optimum. The demand is assumed to be known in advance with sufficient accuracy. We use a technique from optimal control theory for the analysis, which leads to so-called activity periods. During such a period the stock is positive and the production is maximal, provided that the problem starts with zero stock, which is the usual case. Over a period of one or more years, there will be a few activity periods. Outside these periods the stock is zero and the policy is to choose production = the smaller of [demand, maximal production]. The “intrinsic time length” is a central concept. It is simply the maximal time a unit of the product can be stored before selling without creating a loss.

  • 32.
    Bartolini, Gabriel
    Linköpings universitet, Matematiska institutionen, Tillämpad matematik. Linköpings universitet, Tekniska högskolan.
    On the Branch Loci of Moduli Spaces of Riemann Surfaces of Low Genera2009Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    Compact Riemann surfaces of genus greater than 1 can be realized as quotient spaces of the hyperbolic plane by the action of Fuchsian groups. The Teichmüller space is the set of all complex structures of Riemann surfaces and the moduli space the set of conformal equivalence classes of Riemann surfaces. For genus greater than two the branch locus of the covering of the moduli space by the Teichmüller space can be identified wi the set of Riemann surfaces admitting non-trivial automorphisms. Here we give the orbifold structure of the branch locus of surfaces of genus 5 by studying the equisymmetric stratification of the branch locus. This gives the orbifold structure of the moduli space.

    We also show that the strata corresponding to surfaces with automorphisms of order 2 and 3 belong to the same connected component for every genus. Further we show that the branch locus is connected with the exception of one isolated point for genera 5 and 6, it is connected for genus 7 and it is connected with the exception of two isolated points for genus 8.

    Delarbeten
    1. On the connectedness of the branch locus of the moduli space of Riemann surfaces of low genus
    Öppna denna publikation i ny flik eller fönster >>On the connectedness of the branch locus of the moduli space of Riemann surfaces of low genus
    2012 (Engelska)Ingår i: Proceedings of the American Mathematical Society, ISSN 0002-9939, E-ISSN 1088-6826, Vol. 140, nr 1, s. 35-45Artikel i tidskrift (Refereegranskat) Published
    Abstract [en]

    Let be an integer and let , where denotes the moduli space of compact Riemann surfaces of genus . Using uniformization of Riemann surfaces by Fuchsian groups and the equisymmetric stratification of the branch locus of the moduli space, we prove that the subloci corresponding to Riemann surfaces with automorphism groups isomorphic to cyclic groups of order 2 and 3 belong to the same connected component. We also prove the connectedness of for and with the exception of the isolated points given by Kulkarni.

    Ort, förlag, år, upplaga, sidor
    American Mathematical Society, 2012
    Nyckelord
    Moduli spaces, Teichmüller modular group, automorphism group
    Nationell ämneskategori
    Naturvetenskap
    Identifikatorer
    urn:nbn:se:liu:diva-73196 (URN)10.1090/S0002-9939-2011-10881-5 (DOI)000299596000004 ()
    Forskningsfinansiär
    Vetenskapsrådet, 621-2007-6240
    Tillgänglig från: 2011-12-21 Skapad: 2011-12-21 Senast uppdaterad: 2018-09-01
  • 33.
    Beckius, Peter
    et al.
    Linköpings universitet, Institutionen för ekonomisk och industriell utveckling.
    Hübel, Alexander
    Linköpings universitet, Institutionen för ekonomisk och industriell utveckling.
    Vädrets påverkan på försäljningen inom svensk dagligvaruhandel: En studie om vädrets påverkan på ICA:s försäljning2010Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [ar]

    ICA is the largest general dealer in the Swedish market as well as the largest supplier to the independent ICA-dealers. The principal and one of the biggest stakeholders of this thesis is the department Supply Chain Development who is responsible for the development of ICA’s Supply Chain.

    The purpose of this study is to examine how ICA’s sales are affected by weather and to make recommendations on how ICA should proceed with its work regarding this issue. By leveraging their forecasts by including weather, ICA hopes that their logistical metrics amount of spoilage, service levels and number of inventory days will improve. This thesis describes how ICA is working with weather currently, and furthermore it discusses the existing literature within this area. Extensive statistical surveys have been conducted in order to identify the products that are affected by weather, and to examine how they are affected by different weather variables. Finally, the thesis gives recommendations to ICA on how they can improve their forecasting by taking this study’s results into account.

    Presently ICA has no consistent approach when it comes to considering weather’s impact on sales. Each individual product planner uses his own experience and gut feeling and there is no central guidance or other quantitative information there to help them.

    This thesis is organised around two major statistical studies. First, a correlation study examines the correlation between sales and deviation from mean temperature. The weather parameter was selected following recommendations from earlier studies and from SMHI - the national weather institute in Sweden. The study was conducted on ICA’s entire assortment and identified which items that were affected by weather. These turned out to be about a hundred in number and were affected mainly during the summer; however a few items were also affected in the winter. Most of the affected items were rather logical regarding weather’s effects on sales and have also been pointed out by planners as products that are likely to be affected by weather. Following that, several regression analyses were conducted on the selected weather affected assortment.

    The regression analyses were conducted with various combinations of one or more weather parameters as explanatory variables. Surprisingly, in most cases the deviation from mean temperature alone was the parameter that best explained the variance in sales figures. The result or output of this thesis is a value for the expected change in sales for a selected assortment, given a change in deviation from mean temperature.

    The recommendations given at the end of this thesis explains how ICA in a simple and cost effective way could implement the study's results in their daily work. The proposal is to divide the work by what should be done centrally by the forecasting department, and by what should be done individually by each planner. The forecasting department should regularly collect weather forecasts over different time periods, calculate the deviation from mean temperature and distribute it to the supply planner. After that, it is up to the supply planners on how to best take advantage of this information by taking into account other unique factors affecting each category, such as campaigns, holidays and daily indexes that in many cases have more effect on sales than the weather.

  • 34.
    Bengtsson, Martin
    Linköpings universitet, Matematiska institutionen.
    Analytical Expressions for the Hawking Mass in slowly rotating Kerr and Kerr-Newman Space-times2007Självständigt arbete på avancerad nivå (magisterexamen), 20 poäng / 30 hpStudentuppsats
    Abstract [en]

    Penrose's inequality which relates the total mass of a space-time containing a black hole with the area of the event horizon, is a yet unproven condition that is required for the cosmic censorship hypothesis. It is believed that the inequality could be proved by using properties of the Hawking mass. This thesis gives analytical expressions for the Hawking mass in slowly rotating Kerr and Kerr-Newman space-times. It is also shown that the expressions are monotonically increasing, a result that does not contradict Penrose's inequality.

  • 35.
    Berg, Jens
    Uppsala universitet, Avdelningen för beräkningsvetenskap.
    Stable and High-Order Finite Difference Methods for Multiphysics Flow Problems2013Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    Partial differential equations (PDEs) are used to model various phenomena in nature and society, ranging from the motion of fluids and electromagnetic waves to the stock market and traffic jams. There are many methods for numerically approximating solutions to PDEs. Some of the most commonly used ones are the finite volume method, the finite element method, and the finite difference method. All methods have their strengths and weaknesses, and it is the problem at hand that determines which method that is suitable. In this thesis, we focus on the finite difference method which is conceptually easy to understand, has high-order accuracy, and can be efficiently implemented in computer software.

    We use the finite difference method on summation-by-parts (SBP) form, together with a weak implementation of the boundary conditions called the simultaneous approximation term (SAT). Together, SBP and SAT provide a technique for overcoming most of the drawbacks of the finite difference method. The SBP-SAT technique can be used to derive energy stable schemes for any linearly well-posed initial boundary value problem. The stability is not restricted by the order of accuracy, as long as the numerical scheme can be written in SBP form. The weak boundary conditions can be extended to interfaces which are used either in domain decomposition for geometric flexibility, or for coupling of different physics models.

    The contributions in this thesis are twofold. The first part, papers I-IV, develops stable boundary and interface procedures for computational fluid dynamics problems, in particular for problems related to the Navier-Stokes equations and conjugate heat transfer. The second part, papers V-VI, utilizes duality to construct numerical schemes which are not only energy stable, but also dual consistent. Dual consistency alone ensures superconvergence of linear integral functionals from the solutions of SBP-SAT discretizations. By simultaneously considering well-posedness of the primal and dual problems, new advanced boundary conditions can be derived. The new duality based boundary conditions are imposed by SATs, which by construction of the continuous boundary conditions ensure energy stability, dual consistency, and functional superconvergence of the SBP-SAT schemes.

  • 36.
    Berg, Jens
    et al.
    Uppsala University, Department of Information Technology.
    Nordström, Jan
    Linköpings universitet, Matematiska institutionen, Beräkningsmatematik. Linköpings universitet, Tekniska högskolan.
    A stable and dual consistent boundary treatment using finite differences on summation-by-parts form2012Ingår i: European Congress on Computational Methods in Applied Sciences and Engineering, Vienna University of Technology , 2012Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    This paper is concerned with computing very high order accurate linear functionals from a numerical solution of a time-dependent partial differential equation (PDE). Based on finite differences on summation-by-parts form, together with a weak implementation of the boundary conditions, we show how to construct suitable boundary conditions for the PDE such that the continuous problem is well-posed and the discrete problem is stable and spatially dual consistent. These two features result in a superconvergent functional, in the sense that the order of accuracy of the functional is provably higher than that of the solution.

  • 37.
    Berg, Jens
    et al.
    Uppsala University, Sweden.
    Nordström, Jan
    Linköpings universitet, Matematiska institutionen, Beräkningsmatematik. Linköpings universitet, Tekniska högskolan.
    Duality based boundary conditions and dual consistent finite difference discretizations of the Navier–Stokes and Euler equations2014Ingår i: Journal of Computational Physics, ISSN 0021-9991, E-ISSN 1090-2716, Vol. 259, s. 135-153Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper we derive new farfield boundary conditions for the time-dependent Navier–Stokes and Euler equations in two space dimensions. The new boundary conditions are derived by simultaneously considering well-posedess of both the primal and dual problems. We moreover require that the boundary conditions for the primal and dual Navier–Stokes equations converge to well-posed boundary conditions for the primal and dual Euler equations.

    We perform computations with a high-order finite difference scheme on summation-by-parts form with the new boundary conditions imposed weakly by the simultaneous approximation term. We prove that the scheme is both energy stable and dual consistent and show numerically that both linear and non-linear integral functionals become superconvergent.

  • 38.
    Berg, Jens
    et al.
    Uppsala University, Department of Information Technology.
    Nordström, Jan
    Linköpings universitet, Matematiska institutionen, Beräkningsmatematik. Linköpings universitet, Tekniska högskolan.
    Duality based boundary treatment for the Euler and Navier-Stokes equations2013Ingår i: AIAA Aerospace Sciences - Fluid Sciences Event, 2013, s. 1-19Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    In this paper we construct well-posed boundary conditions for the compressible Euler and Navier-Stokes equations in two space dimensions. When also considering the dual equations, we show how to construct the boundary conditions so that both the primal and dual problems are well-posed. By considering the primal and dual problems simultaneously, we construct energy stable and dual consistent finite difference schemes on summation-by-  parts form with weak imposition of the boundary conditions.

    According to linear theory, the stable and dual consistent discretization can be used to compute linear integral functionals from the solution at a superconvergent rate. Here we evaluate numerically the superconvergence property for the non-linear Euler and Navier{ Stokes equations with linear and non-linear integral functionals.

  • 39.
    Berg, Jens
    et al.
    Uppsala University, Department of Information Technology, SE-751 05, Uppsala, Sweden.
    Nordström, Jan
    Linköpings universitet, Matematiska institutionen, Beräkningsmatematik. Linköpings universitet, Tekniska högskolan.
    On the impact of boundary conditions on dual consistent finite difference discretizations2013Ingår i: Journal of Computational Physics, ISSN 0021-9991, E-ISSN 1090-2716, Vol. 236, s. 41-55Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper we derive well-posed boundary conditions for a linear incompletely parabolic system of equations, which can be viewed as a model problem for the compressible Navier{Stokes equations. We show a general procedure for the construction of the boundary conditions such that both the primal and dual equations are wellposed.

    The form of the boundary conditions is chosen such that reduction to rst order form with its complications can be avoided.

    The primal equation is discretized using finite difference operators on summation-by-parts form with weak boundary conditions. It is shown that the discretization can be made energy stable, and that energy stability is sufficient for dual consistency.

    Since reduction to rst order form can be avoided, the discretization is significantly simpler compared to a discretization using Dirichlet boundary conditions.

    We compare the new boundary conditions with standard Dirichlet boundary conditions in terms of rate of convergence, errors and discrete spectra. It is shown that the scheme with the new boundary conditions is not only far simpler, but also has smaller errors, error bounded properties, and highly optimizable eigenvalues, while maintaining all desirable properties of a dual consistent discretization.

  • 40.
    Berg, Jens
    et al.
    Division of Scientific Computing, Department of Information Technology, Uppsala University, Sweden.
    Nordström, Jan
    Linköpings universitet, Matematiska institutionen, Beräkningsmatematik. Linköpings universitet, Tekniska högskolan.
    Spectral analysis of the continuous and discretized heat and advection equation on single and multiple domains2012Ingår i: Applied Numerical Mathematics, ISSN 0168-9274, E-ISSN 1873-5460, Vol. 62, nr 11, s. 1620-1638Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper we study the heat and advectionequation in single and multipledomains. The equations are discretized using a second order accurate finite difference method on Summation-By-Parts form with weak boundary and interface conditions. We derive analytic expressions for the spectrum of the continuous problem and for their corresponding discretization matrices.

    It is shown how the spectrum of the singledomain operator is contained in the multi domain operator spectrum when artificial interfaces are introduced. The interface treatments are posed as a function of one parameter, and the impact on the spectrum and discretization error is investigated as a function of this parameter. Finally we briefly discuss the generalization to higher order accurate schemes.

  • 41.
    Berg, Jens
    et al.
    Uppsala University, Department of Information Technology.
    Nordström, Jan
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Beräkningsvetenskap.
    Stable Robin solid wall boundary conditions for the Navier-Stokes equations2011Ingår i: Journal of Computational Physics, ISSN 0021-9991, E-ISSN 1090-2716, Vol. 230, nr 19, s. 7519-7532Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper we prove stability of Robin solid wall boundary conditions for the compressible Navier–Stokes equations. Applications include the no-slip boundary conditions with prescribed temperature or temperature gradient and the first order slip-flow boundary conditions. The formulation is uniform and the transitions between different boundary conditions are done by a change of parameters. We give different sharp energy estimates depending on the choice of parameters.

    The discretization is done using finite differences on Summation-By-Parts form with weak boundary conditions using the Simultaneous Approximation Term. We verify convergence by the method of manufactured solutions and show computations of flows ranging from no-slip to almost full slip.

  • 42.
    Berg, Jens
    et al.
    Uppsala University, Department of Information Technology, Sweden.
    Nordström, Jan
    Linköpings universitet, Matematiska institutionen, Beräkningsmatematik. Linköpings universitet, Tekniska högskolan.
    Superconvergent functional output for time-dependent problems using finite differences on summation-by-parts form2012Ingår i: Journal of Computational Physics, ISSN 0021-9991, E-ISSN 1090-2716, Vol. 231, nr 20, s. 6846-6860Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Finitedifference operators satisfying the summation-by-parts (SBP) rules can be used to obtain high order accurate, energy stable schemes for time-dependent partial differential equations, when the boundary conditions are imposed weakly by the simultaneous approximation term (SAT).

    In general, an SBP-SAT discretization is accurate of order p + 1 with an internal accuracy of 2p and a boundary accuracy of p. Despite this, it is shown in this paper that any linear functional computed from the time-dependent solution, will be accurate of order 2p when the boundary terms are imposed in a stable and dual consistent way.

    The method does not involve the solution of the dual equations, and superconvergent functionals are obtained at no extra computational cost. Four representative model problems are analyzed in terms of convergence and errors, and it is shown in a systematic way how to derive schemes which gives superconvergentfunctionaloutputs.

  • 43. Berggren, Martin
    et al.
    Ekström, Sven-Erik
    Uppsala universitet, Avdelningen för teknisk databehandling.
    Nordström, Jan
    Uppsala universitet, Avdelningen för teknisk databehandling.
    A discontinuous Galerkin extension of the vertex-centered edge-based finite volume method2009Ingår i: Communications in Computational Physics, ISSN 1815-2406, Vol. 5, s. 456-468Artikel i tidskrift (Refereegranskat)
  • 44.
    Bergman Ärlebäck, Jonas
    Linköpings universitet, Matematiska institutionen, Matematik och tillämpad matematik. Linköpings universitet, Tekniska högskolan.
    Designing, implementing and evaluating mathematical modelling modules at the upper secondary level2009Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This study provides an account of how it is possible to work with mathematical models and modelling at the Swedish upper secondary level. It shows how a researcher and two teachers, departing from what is written in the mathematics curriculum document about mathematical models and modelling and the teachers’ mathematics teaching practices, collaborate to design and develop two so called modelling modules. These two modules designed for, and integrated in, the Mathematics C and Mathematics D course respectively, were implemented in the teachers’ classes and the whole process was evaluated. The students’ experiences of working with the modules were also investigated.

    The conceptual framework used to study this process of design, implementation, and evaluation is built up of design-based research methodology, cultural historical activity theory (CHAT), and co-learning agreement between the researcher and the participants.

    The teachers as well as the students expressed that they enjoyed working on the modules and found the experience positive and rewarding. However, some doubt concerning the learning outcome on behalf of the students were raised among the teachers, and the wish to incorporate more scheduled time into the modules was expressed by the students.

    It is concluded that the participating teachers could had difficulties in expressing a clear conception of the notions of mathematical models or modelling and no affirmative conclusions could be drawn that the participation of the teachers changed their attitudes towards mathematical models and modelling. The designing process was often was restrained by constraints originating from the local school context, and working with modelling highlights many systemic tensions in the established school practice. Also, meta-results in form of suggestions of how to resolve different kinds of tensions in order to improve the study design are reported.

  • 45.
    Bergman Ärlebäck, Jonas
    Linköpings universitet, Matematiska institutionen, Matematik och tillämpad matematik. Linköpings universitet, Tekniska högskolan.
    Matematisk modellering i svenska gymnasieskolans kursplaner i matematik 1965-20002009Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Denna rapport studerar hur begreppen matematisk modell och matematisk modellering behandlats i kursplanerna i matematik för motsvarande svenska gymnasieskolans naturvetenskapliga program mellan åren 1965 och 2000. En översikt över sex kursplaners olika form och innehåll ges och tre olika analyser på tre olika nivåer genomförs; en innehållsanalys, en kvalitativ analys, och en analys som beaktar relationen mellan begreppen modellering, tillämpningar och problemlösning. Analysen visar att matematiska modeller och modellering förekommit implicit sedan kursplanen från 1965, men att begreppen främst i de två senaste kursplanerna lyfts fram explicit och fått en central position i kursplanerna. I den nuvarande kursplanen Gy2000 framgår att matematiska modeller kan tolkas både som ett undervisningsmål i sig och som ett didaktiskt hjälpmedel att lära matematik.

  • 46.
    Berntsson, Fredrik
    Linköpings universitet, Matematiska institutionen, Beräkningsmatematik. Linköpings universitet, Tekniska högskolan.
    An Inverse Heat Conduction Problem and Improving Shielded Thermocouple Accuracy2012Ingår i: Numerical Heat Transfer, Part A Applications, ISSN 1040-7782, E-ISSN 1521-0634, Vol. 61, nr 10, s. 754-763Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    A shielded thermocouple is a measurement device used for monitoring the temperature in chemically, or mechanically, hostile environments. The sensitive parts of the thermocouple are protected by a shielding layer. In order to improve the accuracy of the measurement device, we study an inverse heat conduction problem where the temperature on the surface of the shielding layer is sought, given measured temperatures in the interior of the thermocouple. The procedure is well suited for real-time applications where newly collected data is continuously used to compute current estimates of the surface temperature. Mathematically we can formulate the problem as a Cauchy problem for the heat equation, in cylindrical coordinates, where data is given along the line r = r 1 and the solution is sought at r 1 < r ≤ r 2. The problem is ill-posed, in the sense that the solution (if it exists) does not depend continuously on the data. Thus, regularization techniques are needed. The ill–posedness of the problem is analyzed and a numerical method is proposed. Numerical experiments demonstrate that the proposed method works well.

  • 47.
    Berntsson, Fredrik
    et al.
    Linköpings universitet, Matematiska institutionen, Beräkningsmatematik. Linköpings universitet, Tekniska fakulteten.
    Eldén, Lars
    Linköpings universitet, Matematiska institutionen, Beräkningsmatematik. Linköpings universitet, Tekniska fakulteten.
    Numerical Solution of Cauchy Problems for Elliptic Equations in ``Rectangle-like'' Geometries2005Ingår i: Proceedings for the FEMLAB Conference 2005, 2005Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    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.

  • 48.
    Berntsson, Fredrik
    et al.
    Linköpings universitet, Matematiska institutionen, Beräkningsmatematik. Linköpings universitet, Tekniska fakulteten.
    Karlsson, Matts
    Linköpings universitet, Institutionen för ekonomisk och industriell utveckling, Mekanisk värmeteori och strömningslära. Linköpings universitet, Tekniska fakulteten.
    Kozlov, Vladimir
    Linköpings universitet, Matematiska institutionen, Matematik och tillämpad matematik. Linköpings universitet, Tekniska fakulteten.
    Nazarov, Sergey A.
    St Petersburg State University, St Petersburg State Polytechnical University, and Institute of Problems of Mechanical Engineering RAS, Russia..
    A one-dimensional model of a false aneurysm2017Ingår i: International Journal of Research in Engineering and Science (IJRES), ISSN 2320-9356, Vol. 5, nr 6, s. 61-73Artikel i tidskrift (Refereegranskat)
    Abstract [en]

     A false aneurysm is a hematoma, i.e. collection ofblood outside of a blood vessel, that forms due to a hole  in the wall of an artery . This represents a serious medical condition that needs to be monitored and, under certain conditions, treatedurgently. In this work a one-dimensional model of a false aneurysm isproposed. The new model is based on a one-dimensional model of anartery previously presented by the authors and it takes into accountthe interaction between the hematoma  and the surrounding musclematerial. The model equations are derived  using rigorous asymptoticanalysis for the case of a simplified geometry.   Even though the model is simple it still supports a realisticbehavior for the system consisting of the vessel and the  hematoma. Using numerical simulations we illustrate the behavior ofthe model. We also investigate the effect  of changing the size of the hematoma. The simulations show that ourmodel can reproduce realistic solutions. For instance we show thetypical strong pulsation of an aneurysm by blood entering the hematoma during the work phase of the cardiac cycle, and the blood returning tothe vessel during the resting phase. Also we show that the aneurysmgrows  if the pulse rate is increased due to, e.g., a higher work load. 

  • 49.
    Berntsson, Fredrik
    et al.
    Linköpings universitet, Matematiska institutionen, Beräkningsmatematik. Linköpings universitet, Tekniska högskolan.
    Kozlov, Vladimir A.
    Linköpings universitet, Matematiska institutionen, Matematik och tillämpad matematik. Linköpings universitet, Tekniska högskolan.
    Mpinganzima, Lydie
    Linköpings universitet, Matematiska institutionen, Matematik och tillämpad matematik. Linköpings universitet, Tekniska högskolan. University of Rwanda.
    Turesson, Bengt-Ove
    Linköpings universitet, Matematiska institutionen, Matematik och tillämpad matematik. Linköpings universitet, Tekniska högskolan.
    Numerical Solution of the Cauchy Problem for the Helmholtz Equation2014Rapport (Övrigt vetenskapligt)
    Abstract [en]

    The Cauchy problem for the Helmholtz equation appears in applications related to acoustic or electromagnetic wave phenomena. The problem is ill–posed in the sense that the solution does not depend on the data in a stable way. In this paper we give a detailed study of the problem. Specifically we investigate how the ill–posedness depends on the shape of the computational domain and also on the wave number. Furthermore, we give an overview over standard techniques for dealing with ill–posed problems and apply them to the problem.

  • 50.
    Berntsson, Fredrik
    et al.
    Linköpings universitet, Matematiska institutionen, Beräkningsmatematik. Linköpings universitet, Tekniska fakulteten.
    Kozlov, Vladimir
    Linköpings universitet, Matematiska institutionen, Matematik och tillämpad matematik. Linköpings universitet, Tekniska fakulteten.
    Mpinganzima, L.
    University of Rwanda, Rwanda.
    Turesson, Bengt-Ove
    Linköpings universitet, Matematiska institutionen, Matematik och tillämpad matematik. Linköpings universitet, Tekniska fakulteten.
    Iterative Tikhonov regularization for the Cauchy problem for the Helmholtz equation2017Ingår i: Computers and Mathematics with Applications, ISSN 0898-1221, E-ISSN 1873-7668, Vol. 73, nr 1, s. 163-172Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The Cauchy problem for the Helmholtz equation appears in various applications. The problem is severely ill-posed and regularization is needed to obtain accurate solutions. We start from a formulation of this problem as an operator equation on the boundary of the domain and consider the equation in (H-1/2)* spaces. By introducing an artificial boundary in the interior of the domain we obtain an inner product for this Hilbert space in terms of a quadratic form associated with the Helmholtz equation; perturbed by an integral over the artificial boundary. The perturbation guarantees positivity property of the quadratic form. This inner product allows an efficient evaluation of the adjoint operator in terms of solution of a well-posed boundary value problem for the Helmholtz equation with transmission boundary conditions on the artificial boundary. In an earlier paper we showed how to take advantage of this framework to implement the conjugate gradient method for solving the Cauchy problem. In this work we instead use the Conjugate gradient method for minimizing a Tikhonov functional. The added penalty term regularizes the problem and gives us a regularization parameter that can be used to easily control the stability of the numerical solution with respect to measurement errors in the data. Numerical tests show that the proposed algorithm works well. (C) 2016 Elsevier Ltd. All rights reserved.

1234567 1 - 50 av 557
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf