Relevant bibliographies by topics / Linear problems

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Linear problems'

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

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Linear problems.'

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

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

Journal articles on the topic "Linear problems"

1

Ramzan, Siti Hajar. "Crafting Linear Motion Problems for Problem- Based Learning Physics Classes." International Journal of Psychosocial Rehabilitation 24, no. 5 (April 20, 2020): 5426–37. http://dx.doi.org/10.37200/ijpr/v24i5/pr2020249.

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

Ge, Renpu. "Solving linear programming problems via linear minimax problems." Applied Mathematics and Computation 46, no. 1 (November 1991): 59–77. http://dx.doi.org/10.1016/0096-3003(91)90101-r.

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

Šeda, Valter. "Generalized boundary value problems with linear growth." Mathematica Bohemica 123, no. 4 (1998): 385–404. http://dx.doi.org/10.21136/mb.1998.125969.

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

Eaves, B. Curtis, and Uriel G. Rothblum. "Linear Problems and Linear Algorithms." Journal of Symbolic Computation 20, no. 2 (August 1995): 207–14. http://dx.doi.org/10.1006/jsco.1995.1047.

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

Li, Chi-Kwong, and Stephen Pierce. "Linear Preserver Problems." American Mathematical Monthly 108, no. 7 (August 2001): 591. http://dx.doi.org/10.2307/2695268.

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

Li, Chi-Kwong, and Stephen Pierce. "Linear Preserver Problems." American Mathematical Monthly 108, no. 7 (August 2001): 591–605. http://dx.doi.org/10.1080/00029890.2001.11919790.

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

Djawadi, Mehdi, and Gerd Hofmeister. "Linear diophantine problems." Archiv der Mathematik 66, no. 1 (January 1996): 19–29. http://dx.doi.org/10.1007/bf01323979.

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

M.Jayalakshmi, M. Jayalakshmi, and P. Pandian P.Pandian. "Solving Fully Fuzzy Multi-Objective Linear Programming Problems." International Journal of Scientific Research 3, no. 4 (June 1, 2012): 1–6. http://dx.doi.org/10.15373/22778179/apr2014/174.

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

Sengodan, Gokulraj, and Chandrashekaran Arumugasamy. "Linear complementarity problems and bi-linear games." Applications of Mathematics 65, no. 5 (June 25, 2020): 665–75. http://dx.doi.org/10.21136/am.2020.0371-19.

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

Packel, Edward W. "Do Linear Problems Have Linear Optimal Algorithms?" SIAM Review 30, no. 3 (September 1988): 388–403. http://dx.doi.org/10.1137/1030091.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Linear problems"

1

Kumar, Manish. "Converting some global optimization problems to mixed integer linear problems using piecewise linear approximations." Diss., Rolla, Mo. : University of Missouri-Rolla, 2007. http://scholarsmine.umr.edu/thesis/pdf/Kumar_09007dcc803c8e68.pdf.

Full text
Abstract:
Thesis (M.S.)--University of Missouri--Rolla, 2007.
Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed December 7, 2007) Includes bibliographical references (p. 28).
APA, Harvard, Vancouver, ISO, and other styles
2

Minne, Andreas. "Non-linear Free Boundary Problems." Doctoral thesis, KTH, Matematik (Avd.), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-178110.

Full text
Abstract:
This thesis consists of an introduction and four research papers related to free boundary problems and systems of fully non-linear elliptic equations. Paper A and Paper B prove optimal regularity of solutions to general elliptic and parabolic free boundary problems, where the operators are fully non-linear and convex. Furthermore, it is proven that the free boundary is continuously differentiable around so called "thick" points, and that the free boundary touches the fixed boundary tangentially in two dimensions. Paper C analyzes singular points of solutions to perturbations of the unstable obstacle problem, in three dimensions. Blow-up limits are characterized and shown to be unique. The free boundary is proven to lie close to the zero-level set of the corresponding blow-up limit. Finally, the structure of the singular set is analyzed. Paper D discusses an idea on how existence and uniqueness theorems concerning quasi-monotone fully non-linear elliptic systems can be extended to systems that are not quasi-monotone.

QC 20151210

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

Wokiyi, Dennis. "Non-linear inverse geothermal problems." Licentiate thesis, Linköpings universitet, Matematik och tillämpad matematik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-143031.

Full text
Abstract:
The inverse geothermal problem consist of estimating the temperature distribution below the earth’s surface using temperature and heat-flux measurements on the earth’s surface. The problem is important since temperature governs a variety of the geological processes including formation of magmas, minerals, fosil fuels and also deformation of rocks. Mathematical this problem is formulated as a Cauchy problem for an non-linear elliptic equation and since the thermal properties of the rocks depend strongly on the temperature, the problem is non-linear. This problem is ill-posed in the sense that it does not satisfy atleast one of Hadamard’s definition of well-posedness. We formulated the problem as an ill-posed non-linear operator equation which is defined in terms of solving a well-posed boundary problem. We demonstrate existence of a unique solution to this well-posed problem and give stability estimates in appropriate function spaces. We show that the operator equation is well-defined in appropriate function spaces. Since the problem is ill-posed, regularization is needed to stabilize computations. We demostrate that Tikhonov regularization can be implemented efficiently for solving the operator equation. The algorithm is based on having a code for solving a well- posed problem related to the operator equation. In this study we demostrate that the algorithm works efficiently for 2D calculations but can also be modified to work for 3D calculations.
APA, Harvard, Vancouver, ISO, and other styles
4

Ang, W. T. "Some crack problems in linear elasticity /." Title page, table of contents and summary only, 1987. http://web4.library.adelaide.edu.au/theses/09PH/09pha581.pdf.

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

Higham, N. J. "Nearness problems in numerical linear algebra." Thesis, University of Manchester, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.374580.

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

Austin, D. M. "On two problems in linear elasticity." Thesis, University of Manchester, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.378026.

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

Yodpinyanee, Anak. "Sub-linear algorithms for graph problems." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/120411.

Full text
Abstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 189-199).
In the face of massive data sets, classical algorithmic models, where the algorithm reads the entire input, performs a full computation, then reports the entire output, are rendered infeasible. To handle these data sets, alternative algorithmic models are suggested to solve problems under the restricted, namely sub-linear, resources such as time, memory or randomness. This thesis aims at addressing these limitations on graph problems and combinatorial optimization problems through a number of different models. First, we consider the graph spanner problem in the local computation algorithm (LCA) model. A graph spanner is a subgraph of the input graph that preserves all pairwise distances up to a small multiplicative stretch. Given a query edge from the input graph, the LCA explores a sub-linear portion of the input graph, then decides whether to include this edge in its spanner or not - the answers to all edge queries constitute the output of the LCA. We provide the first LCA constructions for 3 and 5-spanners of general graphs with almost optimal trade-offs between spanner sizes and stretches, and for fixed-stretch spanners of low maximum-degree graphs. Next, we study the set cover problem in the oracle access model. The algorithm accesses a sub-linear portion of the input set system by probing for elements in a set, and for sets containing an element, then computes an approximate minimum set cover: a collection of an approximately-minimum number of sets whose union includes all elements. We provide probe-efficient algorithms for set cover, and complement our results with almost tight lower bound constructions. We further extend our study to the LP-relaxation variants and to the streaming setting, obtaining the first streaming results for the fractional set cover problem. Lastly, we design local-access generators for a collection of fundamental random graph models. We demonstrate how to generate graphs according to the desired probability distribution in an on-the-fly fashion. Our algorithms receive probes about arbitrary parts of the input graph, then construct just enough of the graph to answer these probes, using only polylogarithmic time, additional space and random bits per probe. We also provide the first implementation of random neighbor probes, which is a basic algorithmic building block with applications in various huge graph models.
by Anak Yodpinyanee.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
8

Chonev, Ventsislav. "Reachability problems for linear dynamical systems." Thesis, University of Oxford, 2015. https://ora.ox.ac.uk/objects/uuid:e73d1a5b-edce-4e1d-a593-fd8df7e2a817.

Full text
Abstract:
The object of principal interest in this thesis is linear dynamical systems: deterministic systems which evolve under a linear operator. They are specified by an initial state set I, contained in ℝm, and a real m-by-m evolution matrix A. We distinguish two varieties of linear dynamical systems: discrete-time and continuous-time. In the discrete-time setting, the state x(n) of the system at time n for natural n is governed by the difference equation x(n)=Ax(n-1). Similarly, in the continuous case, the state x(t) at real, non-negative times t is determined by a system of first-order linear differential equations: x'(t) = Ax(t). In both cases, x(0) lies in I. Throughout this thesis, we will be interested in the Reachability Problem for linear dynamical systems, which may be formulated in a general way as follows: given a target set T contained in ℝm and a (discrete- or continuous-time) linear dynamical system specified by the evolution matrix A and the set of initial states I, determine whether for all x(0) in I, starting from x(0), the system will eventually be in a state which lies in T. In order to make the decision problem well-defined, one must first fix an admissible class of initial sets and, similarly, a class of target sets of interest. For the purposes of expressing the problem instance, it is also necessary to restrict the domain of the input data to a subset of the reals which may be represented effectively, such as the rational numbers or the algebraic numbers. As we vary the choice of domain, the types of initial and target sets under consideration and the discreteness of time, a rich landscape of decision problems emerges. The goal of the present thesis is to explore pointwise reachability problems, that is, reachability from a single initial state. Under the assumption that I consists of a single point in ℝm provided as part of the input data, we will study reachability to polyhedral targets, in the context of both discrete- and continuous-time linear dynamical systems. We prove both upper complexity bounds and hardness results, employing in the process a wide-ranging arsenal of techniques and mathematical tools. We rely on powerful number-theoretic results, such as Baker's Theorem on inhomogeneous linear forms of logarithms of algebraic numbers, Schanuel's Conjecture on the transcendence degree of certain field extensions of the rationals, and Kronecker's Theorem on simultaneous inhomogeneous Diophantine approximation. We draw interesting connections with the study of linear recurrence sequences and exponential polynomials, and relate pointwise reachability to open problems concerning the approximability by rationals of algebraic numbers and logarithms of algebraic numbers. Albeit a simple model, linear dynamical systems are of profound interest, both from a theoretical and a practical standpoint. Reachability problems for linear dynamical systems have recently elicited considerable attention, due to their frequent occurrence in practice and their deep and wide-ranging connections with other fascinating areas of study, such as problems on Markov chains (Akshay et al., 2015), quantum automata (Derksen et al., 2005), Lindenmayer systems (Salomaa and Soittola, 1978), linear loops (Braverman, 2006), linear recurrence sequences (Everest et al., 2003) and exponential polynomials (Bell et al., 2010).
APA, Harvard, Vancouver, ISO, and other styles
9

Julius, Hayden. "Nonstandard solutions of linear preserver problems." Kent State University / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=kent1626101272174819.

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

羅恩妮 and Yan-nei Law. "Some additive preserver problems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B31222912.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Linear problems"

1

Linear discrete parabolic problems. Boston: Elsevier, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

1905-, Tucker Albert W., ed. Linear programs and related problems. Boston: Academic Press, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Linear and quasilinear parabolic problems. Basel: Birkhäuser Verlag, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

service), SpringerLink (Online, ed. Eigenvalues of Non-Linear Problems. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Amann, Herbert. Linear and Quasilinear Parabolic Problems. Basel: Birkhäuser Basel, 1995. http://dx.doi.org/10.1007/978-3-0348-9221-6.

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

Prodi, G., ed. Eigenvalues of Non-Linear Problems. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-10940-9.

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

Prodi, G., ed. Problems in Non-Linear Analysis. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-10998-0.

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

Amann, Herbert. Linear and Quasilinear Parabolic Problems. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-11763-4.

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

Fabrizio, Mauro. Mathematical problems in linear viscoelasticity. Philadelphia: Society for Industrial and Applied Mathematics, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

service), SpringerLink (Online, ed. Problems in Non-Linear Analysis. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Linear problems"

1

Gazzola, Filippo, Hans-Christoph Grunau, and Guido Sweers. "Linear Problems." In Lecture Notes in Mathematics, 27–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12245-3_2.

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

Kisačanin, Branislav, and Gyan C. Agarwal. "Exercise problems." In Linear Control Systems, 273–85. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-1-4615-0553-2_5.

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

Poler, Raúl, Josefa Mula, and Manuel Díaz-Madroñero. "Linear Programming." In Operations Research Problems, 1–48. London: Springer London, 2013. http://dx.doi.org/10.1007/978-1-4471-5577-5_1.

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

Wasow, Wolfgang. "Connection Problems." In Linear Turning Point Theory, 140–63. New York, NY: Springer New York, 1985. http://dx.doi.org/10.1007/978-1-4612-1090-0_8.

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

Eidelman, Samuil D., and Nicolae V. Zhitarashu. "Linear Operators." In Parabolic Boundary Value Problems, 47–77. Basel: Birkhäuser Basel, 1998. http://dx.doi.org/10.1007/978-3-0348-8767-0_3.

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

de Souza, Paulo Ney, and Jorge-Nuno Silva. "Linear Algebra." In Berkeley Problems in Mathematics, 371–420. New York, NY: Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4615-6520-8_14.

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

de Souza, Paulo Ney, and Jorge-Nuno Silva. "Linear Algebra." In Berkeley Problems in Mathematics, 109–36. New York, NY: Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4615-6520-8_7.

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

de Souza, Paulo Ney, and Jorge-Nuno Silva. "Linear Algebra." In Berkeley Problems in Mathematics, 489–568. New York, NY: Springer New York, 2004. http://dx.doi.org/10.1007/978-0-387-21825-0_14.

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

de Souza, Paulo Ney, and Jorge-Nuno Silva. "Linear Algebra." In Berkeley Problems in Mathematics, 123–54. New York, NY: Springer New York, 2004. http://dx.doi.org/10.1007/978-0-387-21825-0_7.

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

de Souza, Paulo Ney, and Jorge-Nuno Silva. "Linear Algebra." In Berkeley Problems in Mathematics, 443–512. New York, NY: Springer New York, 2001. http://dx.doi.org/10.1007/978-1-4684-9294-1_14.

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

Conference papers on the topic "Linear problems"

1

Huang, Shao-Lun, and Lizhong Zheng. "Linear information coupling problems." In 2012 IEEE International Symposium on Information Theory - ISIT. IEEE, 2012. http://dx.doi.org/10.1109/isit.2012.6283007.

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

Jones, Colin N., and Manfred Morrari. "Multiparametric Linear Complementarity Problems." In Proceedings of the 45th IEEE Conference on Decision and Control. IEEE, 2006. http://dx.doi.org/10.1109/cdc.2006.377797.

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

Anai, Hirokazu, and Volker Weispfenning. "Deciding linear-trigonometric problems." In the 2000 international symposium. New York, New York, USA: ACM Press, 2000. http://dx.doi.org/10.1145/345542.345567.

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

SOUROUR, AHMED RAMZI. "THREE LINEAR PRESERVER PROBLEMS." In Proceedings of the International Conference. WORLD SCIENTIFIC, 2001. http://dx.doi.org/10.1142/9789812810243_0017.

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

Li, Hua, and Yuan D. Ji. "Solving linear hard-optimization problems." In Aerospace Sensing, edited by Dennis W. Ruck. SPIE, 1992. http://dx.doi.org/10.1117/12.140089.

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

Muller, Orna, and Bruria Haberman. "A non-linear approach to solving linear algorithmic problems." In 2010 IEEE Frontiers in Education Conference (FIE). IEEE, 2010. http://dx.doi.org/10.1109/fie.2010.5673643.

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

LASSAS, MATTI. "INVERSE PROBLEMS FOR LINEAR AND NON-LINEAR HYPERBOLIC EQUATIONS." In International Congress of Mathematicians 2018. WORLD SCIENTIFIC, 2019. http://dx.doi.org/10.1142/9789813272880_0199.

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

Saberi, A., J. Han, and A. A. Stoorvogel. "Constrained stabilization problems for linear plants." In Proceedings of 2000 American Control Conference (ACC 2000). IEEE, 2000. http://dx.doi.org/10.1109/acc.2000.877052.

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

Heemels, W. P. M. H., J. M. Schumacher, and S. Weiland. "Complementarity problems in linear complementarity systems." In Proceedings of the 1998 American Control Conference (ACC). IEEE, 1998. http://dx.doi.org/10.1109/acc.1998.703498.

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

Li, Jian, Cheng Qian, and Gang Tu. "Linear Analysis Method for Scheduling Problems." In 2014 6th International Conference on Multimedia, Computer Graphics and Broadcasting (MulGraB). IEEE, 2014. http://dx.doi.org/10.1109/mulgrab.2014.19.

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

Reports on the topic "Linear problems"

1

Benigno, Pierpaolo, and Michael Woodford. Linear-Quadratic Approximation of Optimal Policy Problems. Cambridge, MA: National Bureau of Economic Research, November 2006. http://dx.doi.org/10.3386/w12672.

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

Mangasarian, O. L., and T. H. Shiau. Error Bounds for Monotone Linear Complementarity Problems. Fort Belvoir, VA: Defense Technical Information Center, September 1985. http://dx.doi.org/10.21236/ada160975.

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

Shiau, Tzong H. Iterative Methods for Linear Complementary and Related Problems. Fort Belvoir, VA: Defense Technical Information Center, May 1989. http://dx.doi.org/10.21236/ada212848.

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

Rundell, William, and Michael S. Pilant. Undetermined Coefficient Problems for Quasi-Linear Parabolic Equations. Fort Belvoir, VA: Defense Technical Information Center, September 1992. http://dx.doi.org/10.21236/ada256012.

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

Brigola, R., and A. Keller. On Functional Estimates for Ill-Posed Linear Problems. Fort Belvoir, VA: Defense Technical Information Center, April 1988. http://dx.doi.org/10.21236/ada198004.

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

Hendon, Raymond C., and Scott D. Ramsey. Radiation Hydrodynamics Test Problems with Linear Velocity Profiles. Office of Scientific and Technical Information (OSTI), August 2012. http://dx.doi.org/10.2172/1049354.

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

Pilant, Michael S., and William Rundell. Undetermined Coefficient Problems for Quasi-Linear Parabolic Equations. Fort Belvoir, VA: Defense Technical Information Center, December 1989. http://dx.doi.org/10.21236/ada218462.

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

Zhaojun Bai, James Demmel, and Jack Dongarra. Toolboxes and Templates for Large Scale Linear Algebra Problems. Office of Scientific and Technical Information (OSTI), October 2002. http://dx.doi.org/10.2172/841936.

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

Tropp, Joel A., and Stephen J. Wright. Computational Methods for Sparse Solution of Linear Inverse Problems. Fort Belvoir, VA: Defense Technical Information Center, March 2009. http://dx.doi.org/10.21236/ada633835.

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

Li, Zhilin, and Kazufumi Ito. Theoretical and Numerical Analysis for Non-Linear Interface Problems. Fort Belvoir, VA: Defense Technical Information Center, April 2007. http://dx.doi.org/10.21236/ada474058.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Linear problems' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography