Relevant bibliographies by topics / Mathematical software problems

Contents

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

Academic literature on the topic 'Mathematical software problems'

Author: Grafiati
Published: 4 June 2021
Last updated: 8 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 'Mathematical software 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 "Mathematical software problems"

1

Pruess, Steven, and Charles T. Fulton. "Mathematical software for Sturm-Liouville problems." ACM Transactions on Mathematical Software 19, no. 3 (1993): 360–76. http://dx.doi.org/10.1145/155743.155791.

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

Chizhukhin, G. N., Yu G. Bochkareva, and O. V. Kulagin. "Mathematical Problems of Information Protection in Software." Telecommunications and Radio Engineering 68, no. 13 (2009): 1161–68. http://dx.doi.org/10.1615/telecomradeng.v68.i13.40.

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

Rakhmatov, Dilmurod. "PROBLEMS IN MATHEMATICAL THEOREMS AND SOFTWARE TECHNOLOGY." PHYSICAL AND MATHEMATICAL SCIENCES 3, no. 1 (2020): 19–22. http://dx.doi.org/10.26739/2181-0656-2020-3-4.

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

Lutovac, Miroslav, and Dejan Tosic. "Symbolic signal processing and system analysis." Facta universitatis - series: Electronics and Energetics 16, no. 3 (2003): 423–31. http://dx.doi.org/10.2298/fuee0303423l.

Full text
Abstract:
We present new software in MATLAB and Mathematica for symbolic signal processing and system analysis. Our mission is to encapsulate high-tech engineering and sophisticated mathematical knowledge into easy-to-use software that effectively solves practical problems.
APA, Harvard, Vancouver, ISO, and other styles
5

Syahmarani, Aghni, and Putri Khairiah Nasution. "Training in using maple and geogebra software for mathematics teachers in the environment SMA Negeri 15 Medan." ABDIMAS TALENTA: Jurnal Pengabdian Kepada Masyarakat 5, no. 1 (2020): 13–18. http://dx.doi.org/10.32734/abdimastalenta.v5i1.4019.

Full text
Abstract:
Currently there are lots of softwares to solve problems including math problems. Mathematics teachers are now starting to be demanded to be able to operate some mathematical software to be considered capable of adapting to scientific developments, especially information technology at this time. For this reason training is needed for mathematics teachers so that they can master some mathematical software so that they become professional and more competent teachers. Dedication to this community will provide training to mathematics teachers, especially mathematics teachers in SMA Negeri 15 Medan to be able to use two pieces of mathematical software namely MAPLE and GEOGEBRA so that the competencies of these mathematics teachers increase and be more updated with technology.
APA, Harvard, Vancouver, ISO, and other styles
6

Kim, Youngdae, and Michael C. Ferris. "Solving equilibrium problems using extended mathematical programming." Mathematical Programming Computation 11, no. 3 (2019): 457–501. http://dx.doi.org/10.1007/s12532-019-00156-4.

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

Bessonov, O. A., and N. A. Kharchenko. "Software Platform for Supercomputer Modeling of Aerothermodynamics Problems." Programmnaya Ingeneria 12, no. 6 (2021): 302–10. http://dx.doi.org/10.17587/prin.12.302-310.

Full text
Abstract:
Numerical solution of aerothermodynamics problems requires a lot of processor time, and for this reason, the numerical codes for such simulations must be efficiently parallelized. This paper presents a software platform based on a technological approach that greatly simplifies the parallelization of problems with unstructured grids. The paper formulates the principle of a unified mathematical address space of the problem for all used cluster nodes. The formalization of the presented technological approach and the implementation of its software basis in the form of data structures, exchange routines and work rules form a software platform on the basis of which parallel computational programs can be built. This approach is implemented and tested for the problem of modeling the characteristics of aircrafts, but it can be applied to other problems using unstructured grids with one-dimensional cell numbering. In this case, the physical and mathematical specifics of the problem are not important. Parallelization of the code with the new approach is carried out with minimal effort, without changing the main parts of the program. As a result, a single computational code can be created for all regimes — sequential, multi-threaded, and cluster. The performance results obtained with the new code confirm the good scalability of the parallelization method.
APA, Harvard, Vancouver, ISO, and other styles
8

Ray, Gautam. "Computer Aided Problem Based Learning in Engineering Dynamics." Applied Mechanics and Materials 704 (December 2014): 148–53. http://dx.doi.org/10.4028/www.scientific.net/amm.704.148.

Full text
Abstract:
In this paper we demonstrated the use of Problem Based Learning (PBL) in undergraduate Engineering Dynamics. In PBL, the students enhance their learning by solving problems. In some engineering courses, often the students are not able to explore real life and somewhat complex problems due to inability to handle the mathematical rigor. By using software such as Mathematica® we created modules for some Engineering Dynamics problems. These modules allowed students to concentrate on the formulation and “Physics” and interpretation of the problems of the rather than the rigors of mathematical solutions.
APA, Harvard, Vancouver, ISO, and other styles
9

Kastornova, Vasilina. "Recursion as a Mathematical Problems Solving Method Using Instrumental Software Resources." Russian Digital Libraries Journal 23, no. 1-2 (2020): 72–82. http://dx.doi.org/10.26907/1562-5419-2020-23-1-2-72-82.

Full text
Abstract:
The article discusses the recursive ratios implementation in solving mathematical problems using instrumental software resources. It is emphasized that programs development for solving such problems contributes to a deeper understanding of the recursion process essence.
APA, Harvard, Vancouver, ISO, and other styles
10

Kalantarnia, Zahra, Mohsen Rostamy-Malkhalifeh, Ahmad Ahmad Shahvarani, and Mohammad-Hassan Behzadi. "The study of application of algebrator software for mathematical problems solving." Mathematics Education Trends and Research 2012 (2012): 1–7. http://dx.doi.org/10.5899/2012/metr-00003.

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

Dissertations / Theses on the topic "Mathematical software problems"

1

Chang, Tyler Hunter. "Mathematical Software for Multiobjective Optimization Problems." Diss., Virginia Tech, 2020. http://hdl.handle.net/10919/98915.

Full text
Abstract:
In this thesis, two distinct problems in data-driven computational science are considered. The main problem of interest is the multiobjective optimization problem, where the tradeoff surface (called the Pareto front) between multiple conflicting objectives must be approximated in order to identify designs that balance real-world tradeoffs. In order to solve multiobjective optimization problems that are derived from computationally expensive blackbox functions, such as engineering design optimization problems, several methodologies are combined, including surrogate modeling, trust region methods, and adaptive weighting. The result is a numerical software package that finds approximately Pareto optimal solutions that are evenly distributed across the Pareto front, using minimal cost function evaluations. The second problem of interest is the closely related problem of multivariate interpolation, where an unknown response surface representing an underlying phenomenon is approximated by finding a function that exactly matches available data. To solve the interpolation problem, a novel algorithm is proposed for computing only a sparse subset of the elements in the Delaunay triangulation, as needed to compute the Delaunay interpolant. For high-dimensional data, this reduces the time and space complexity of Delaunay interpolation from exponential time to polynomial time in practice. For each of the above problems, both serial and parallel implementations are described. Additionally, both solutions are demonstrated on real-world problems in computer system performance modeling.<br>Doctor of Philosophy<br>Science and engineering are full of multiobjective tradeoff problems. For example, a portfolio manager may seek to build a financial portfolio with low risk, high return rates, and minimal transaction fees; an aircraft engineer may seek a design that maximizes lift, minimizes drag force, and minimizes aircraft weight; a chemist may seek a catalyst with low viscosity, low production costs, and high effective yield; or a computational scientist may seek to fit a numerical model that minimizes the fit error while also minimizing a regularization term that leverages domain knowledge. Often, these criteria are conflicting, meaning that improved performance by one criterion must be at the expense of decreased performance in another criterion. The solution to a multiobjective optimization problem allows decision makers to balance the inherent tradeoff between conflicting objectives. A related problem is the multivariate interpolation problem, where the goal is to predict the outcome of an event based on a database of past observations, while exactly matching all observations in that database. Multivariate interpolation problems are equally as prevalent and impactful as multiobjective optimization problems. For example, a pharmaceutical company may seek a prediction for the costs and effects of a proposed drug; an aerospace engineer may seek a prediction for the lift and drag of a new aircraft design; or a search engine may seek a prediction for the classification of an unlabeled image. Delaunay interpolation offers a unique solution to this problem, backed by decades of rigorous theory and analytical error bounds, but does not scale to high-dimensional "big data" problems. In this thesis, novel algorithms and software are proposed for solving both of these extremely difficult problems.
APA, Harvard, Vancouver, ISO, and other styles
2

Lawson, Jane. "Towards error control for the numerical solution of parabolic equations." Thesis, University of Leeds, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.329947.

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

Vincent, Jill. "Mechanical linkages, dynamic geometry software, and argumentation : supporting a classroom culture of mathematical proof /." Connect to thesis, 2002. http://eprints.unimelb.edu.au/archive/00001399.

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

Graf, Edith Aurora. "Designing a computer tutorial to correct a common student misconception in mathematics /." Thesis, Connect to this title online; UW restricted, 2000. http://hdl.handle.net/1773/9154.

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

Vasconcelos, Francisco Ricardo Nogueira de. "ResoluÃÃo de problemas de congruÃncia de triÃngulos com auxÃlio do software Geogebra." Universidade Federal do CearÃ, 2015. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=15153.

Full text
Abstract:
nÃo hÃ<br>O nosso desafio como professor à possibilitar a melhoria da qualidade do ensino em MatemÃtica buscando meios de garantir a formaÃÃo de cidadÃos capazes de reconhecer o seu papel perante a sociedade e descobrir caminhos elucidativos para o desempenho de uma carreira profissional promissora. Nesse sentido buscamos focar a nossa pesquisa em aÃÃes pedagÃgicas que possibilitem o desenvolvimento das potencialidades cognitivas dos alunos no estudo de congruÃncia. Para isso, propomos o uso do software GeoGebra como ferramenta didÃtica para as aulas de Geometria Plana, por entendermos que esse recurso favorece ao aluno um ambiente favorÃvel ao desenvolvimento da aprendizagem e coloca o professor com mediador no processo de sistematizaÃÃo conceitual das ideias matemÃticas necessÃrias para o desenvolvimento das estruturas cognitivas dos alunos. O objetivo do nosso estudo consiste em subsidiar os alunos do curso de licenciatura em MatemÃtica do Instituto Federal de EducaÃÃo, CiÃncia e Tecnologia, no sentido de utilizar o software GeoGebra como ferramenta didÃtica auxiliar para a resoluÃÃo de problemas de Geometria Plana, que envolvem casos de congruÃncia de triÃngulos. Para a anÃlise e coleta de dados foi realizado o estudo do projeto pedagÃgico do curso e a realizaÃÃo de 01 minicurso para utilizaÃÃo do software GeoGebra destinado a 21 alunos regularmente matriculados na disciplina de Geometria Plana. Utilizamos como instrumentos de pesquisa: 02 questionÃrios diagnÃsticos, observaÃÃo e o registro fotogrÃfico. As anÃlises dos resultados evidenciaram que os alunos se mostraram interessados ao uso do software GeoGebra em sala de aula. O minicurso e as atividades didÃticas aplicadas tiveram um bom nÃvel de aceitaÃÃo por parte dos futuros professores de MatemÃtica. As conclusÃes ressaltam que o uso do software GeoGebra deve ser entendido como ferramenta didÃtica alternativa para o ensino de Geometria, no sentido de proporcionar ao aluno, uma metodologia dinÃmica, interativa e lÃdica para se aprender MatemÃtica.<br>Our challenge as a teacher is to enable the improvement of education quality in mathematics looking for ways to ensure the formation of citizens able to recognize their role in society and find illuminating paths to the performance of a promising career. In this sense, we seek to focus our research on pedagogical actions which enable the development of the students cognitive potential. For this, we propose the use of GeoGebra software as a teaching tool for Plane Geometry classes, because we believe that this resource provides a favorable environment for the development of learning to the student and places the teacher as a mediator in the process of conceptual systematization of the necessary mathematical ideas to the development of the students cognitive structures. The aim of our study is to support the students of degree in Mathematics from the Federal Institute of Education, Science and Technology in order to use GeoGebra software as a teaching tool to help solving plane geometry problems involving cases of congruence triangles. For analysis and data collection, it was carried out the study of the pedagogical project of the course and the completion of a short course for the use of GeoGebra software designed for 21 students enrolled in plane geometry discipline.We used as research tools two diagnostic questionnaires, observation and photographic record. Analysis of the results showed that students in the degree course were receptive to the use of GeoGebra software in the classroom, and the short course and teaching activities applied had a great level of acceptance by the future teachers of mathematics.The conclusions point out that the use of GeoGebra software should be understood as an alternative teaching tool for teaching Geometry in order to provide the student a dynamic, interactive and fun method for learning mathematics.
APA, Harvard, Vancouver, ISO, and other styles
6

Siahaan, Antony. "Defect correction based domain decomposition methods for some nonlinear problems." Thesis, University of Greenwich, 2011. http://gala.gre.ac.uk/7144/.

Full text
Abstract:
Defect correction schemes as a class of nonoverlapping domain decomposition methods offer several advantages in the ways they split a complex problem into several subdomain problems with less complexity. The schemes need a nonlinear solver to take care of the residual at the interface. The adaptive-∝ solver can converge locally in the ∞-norm, where the sufficient condition requires a relatively small local neighbourhood and the problem must have a strongly diagonal dominant Jacobian matrix with a very small condition number. Yet its advantage can be of high signicance in the computational cost where it simply needs a scalar as the approximation of Jacobian matrix. Other nonlinear solvers employed for the schemes are a Newton-GMRES method, a Newton method with a finite difference Jacobian approximation, and nonlinear conjugate gradient solvers with Fletcher-Reeves and Pollak-Ribiere searching direction formulas. The schemes are applied to three nonlinear problems. The first problem is a heat conduction in a multichip module where there the domain is assembled from many components of different conductivities and physical sizes. Here the implementations of the schemes satisfy the component meshing and gluing concept. A finite difference approximation of the residual of the governing equation turns out to be a better defect equation than the equality of normal derivative. Of all the nonlinear solvers implemented in the defect correction scheme, the nonlinear conjugate gradient method with Fletcher-Reeves searching direction has the best performance. The second problem is a 2D single-phase fluid flow with heat transfer where the PHOENICS CFD code is used to run the subdomain computation. The Newton method with a finite difference Jacobian is a reasonable interface solver in coupling these subdomain computations. The final problem is a multiphase heat and moisture transfer in a porous textile. The PHOENICS code is also used to solve the system of partial differential equations governing the multiphase process in each subdomain while the coupling of the subdomain solutions is taken care of with some FORTRAN codes by the defect correction schemes. A scheme using a modified-∝ method fails to obtain decent solutions in both single and two layers case. On the other hand, the scheme using the above Newton method produces satisfying results for both cases where it can lead an initially distant interface data into a good convergent solution. However, it is found that in general the number of nonlinear iteration of the defect correction schemes increases with the mesh refinement.
APA, Harvard, Vancouver, ISO, and other styles
7

Koripalli, RadhaShilpa. "Parameter Tuning for Optimization Software." VCU Scholars Compass, 2012. http://scholarscompass.vcu.edu/etd/2862.

Full text
Abstract:
Mixed integer programming (MIP) problems are highly parameterized, and finding parameter settings that achieve high performance for specific types of MIP instances is challenging. This paper presents a method to find the information about how CPLEX solver parameter settings perform for the different classes of mixed integer linear programs by using designed experiments and statistical models. Fitting a model through design of experiments helps in finding the optimal region across all combinations of parameter settings. The study involves recognizing the best parameter settings that results in the best performance for a specific class of instances. Choosing good setting has a large effect in minimizing the solution time and optimality gap.
APA, Harvard, Vancouver, ISO, and other styles
8

Kwanashie, Augustine. "Efficient algorithms for optimal matching problems under preferences." Thesis, University of Glasgow, 2015. http://theses.gla.ac.uk/6706/.

Full text
Abstract:
In this thesis we consider efficient algorithms for matching problems involving preferences, i.e., problems where agents may be required to list other agents that they find acceptable in order of preference. In particular we mainly study the Stable Marriage problem (SM), the Hospitals / Residents problem (HR) and the Student / Project Allocation problem (SPA), and some of their variants. In some of these problems the aim is to find a stable matching which is one that admits no blocking pair. A blocking pair with respect to a matching is a pair of agents that prefer to be matched to each other than their assigned partners in the matching if any. We present an Integer Programming (IP) model for the Hospitals / Residents problem with Ties (HRT) and use it to find a maximum cardinality stable matching. We also present results from an empirical evaluation of our model which show it to be scalable with respect to real-world HRT instance sizes. Motivated by the observation that not all blocking pairs that exist in theory will lead to a matching being undermined in practice, we investigate a relaxed stability criterion called social stability where only pairs of agents with a social relationship have the ability to undermine a matching. This stability concept is studied in instances of the Stable Marriage problem with Incomplete lists (smi) and in instances of hr. We show that, in the smi and hr contexts, socially stable matchings can be of varying sizes and the problem of finding a maximum socially stable matching (max smiss and max hrss respectively) is NP-hard though approximable within 3/2. Furthermore we give polynomial time algorithms for three special cases of the problem arising from restrictions on the social network graph and the lengths of agents’ preference lists. We also consider other optimality criteria with respect to social stability and establish inapproximability bounds for the problems of finding an egalitarian, minimum regret and sex equal socially stable matching in the sm context. We extend our study of social stability by considering other variants and restrictions of max smiss and max hrss. We present NP-hardness results for max smiss even under certain restrictions on the degree and structure of the social network graph as well as the presence of master lists. Other NP-hardness results presented relate to the problem of determining whether a given man-woman pair belongs to a socially stable matching and the problem of determining whether a given man (or woman) is part of at least one socially stable matching. We also consider the Stable Roommates problem with Incomplete lists under Social Stability (a non-bipartite generalisation of smi under social stability). We observe that the problem of finding a maximum socially stable matching in this context is also NP-hard. We present efficient algorithms for three special cases of the problem arising from restrictions on the social network graph and the lengths of agents’ preference lists. These are the cases where (i) there exists a constant number of acquainted pairs (ii) or a constant number of unacquainted pairs or (iii) each preference list is of length at most 2. We also present algorithmic results for finding matchings in the spa context that are optimal with respect to profile, which is the vector whose ith component is the number of students assigned to their ith-choice project. We present an efficient algorithm for finding a greedy maximum matching in the spa context — this is a maximum matching whose profile is lexicographically maximum. We then show how to adapt this algorithm to find a generous maximum matching — this is a matching whose reverse profile is lexicographically minimum. We demonstrate how this approach can allow additional constraints, such as lecturer lower quotas, to be handled flexibly. We also present results of empirical evaluations carried out on both real world and randomly generated datasets. These results demonstrate the scalability of our algorithms as well as some interesting properties of these profile-based optimality criteria. Practical applications of spa motivate the investigation of certain special cases of the problem. For instance, it is often desired that the workload on lecturers is evenly distributed (i.e. load balanced). We enforce this by either adding lower quota constraints on the lecturers (which leads to the potential for infeasible problem instances) or adding a load balancing optimisation criterion. We present efficient algorithms in both cases. Another consideration is the fact that certain projects may require a minimum number of students to become viable. This can be handled by enforcing lower quota constraints on the projects (which also leads to the possibility of infeasible problem instances). A technique of handling this infeasibility is the idea of closing projects that do not meet their lower quotas (i.e. leaving such project completely unassigned). We show that the problem of finding a maximum matching subject to project lower quotas where projects can be closed is NP-hard even under severe restrictions on preference lists lengths and project upper and lower quotas. To offset this hardness, we present polynomial time heuristics that find large feasible matchings in practice. We also present ip models for the spa variants discussed and show results obtained from an empirical evaluation carried out on both real and randomly generated datasets. These results show that our algorithms and heuristics are scalable and provide good matchings with respect to profile-based optimality.
APA, Harvard, Vancouver, ISO, and other styles
9

McGinn, Michelle Katherine. "Researching problem solving in software design, mathematics, and statistical consulting, from qualitative case studies to grounded theory." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/NQ51899.pdf.

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

Boccardo, Mateus Eduardo [UNESP]. "Sistemas lineares: aplicações e propostas de aula usando a metodologia de resolução de problemas e o software GeoGebra." Universidade Estadual Paulista (UNESP), 2017. http://hdl.handle.net/11449/151922.

Full text
Abstract:
Submitted by Mateus Eduardo Boccardo null (mateuseboccardo@hotmail.com) on 2017-10-16T21:58:41Z No. of bitstreams: 1 SISTEMAS LINEARES- APLICAÇÕES E PROPOSTAS DE AULA USANDO A METODOLOGIA DE RESOLUÇÃO DE PROBLEMAS E O SOFTWARE GEOGEBRA.pdf: 1649568 bytes, checksum: c2692aee302e29bada55e36958c6599b (MD5)<br>Approved for entry into archive by Monique Sasaki (sayumi_sasaki@hotmail.com) on 2017-10-18T18:37:19Z (GMT) No. of bitstreams: 1 boccardo_me_me_sjrp.pdf: 1649568 bytes, checksum: c2692aee302e29bada55e36958c6599b (MD5)<br>Made available in DSpace on 2017-10-18T18:37:19Z (GMT). No. of bitstreams: 1 boccardo_me_me_sjrp.pdf: 1649568 bytes, checksum: c2692aee302e29bada55e36958c6599b (MD5) Previous issue date: 2017-09-25<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)<br>Sistemas Lineares, mais precisamente, Sistemas de Equações Lineares, é ferramenta útil para a resolução de vários problemas práticos e importantes, por exemplo, problemas relacionados a tráfego de veículos, balanceamento de equações químicas, cálculo de uma alimentação diária equilibrada, circuitos elétricos e interpolação polinomial. Neste trabalho abordamos o conteúdo Sistemas Lineares, seus métodos de resolução, algumas de suas inúmeras aplicações, bem como a interpretação geométrica do conjunto solução de sistemas lineares em duas ou três variáveis. Apresentamos também, uma análise de como esse assunto é tratado em alguns documentos oficiais de ensino. Por fim, são expostas duas Propostas de Aula que foram elaboradas para alunos do Ensino Básico, uma para ser desenvolvida usando a Resolução de Problemas como metodologia de ensino (na abordagem de problemas sobre sistemas lineares) e outra, sobre a Interpretação Geométrica do conjunto solução de Sistemas Lineares, para ser realizada na Sala de Informática, utilizando o software GeoGebra.<br>Linear System, more precisely, System of Linear Equations, is a useful tool for their solution of several practical and important problems, for example problems related to vehicle traffic, balancing of chemical equations, elaboration healthy daily diet, electrical circuits and polynomial interpolation. In this work, we study Linear System, its methods of resolution, some of its numerous applications, as well as the geometric interpretation of the solution set of linear system in two or three variables. We also present an analysis of how this subject is treated in some official teaching documents. Finally, we present two Class Proposals that are elaborated for Basic Education students, one to be developed using Problem Solving as a teaching methodology (in the approach to problems on linear system) and another, on the Geometric Interpretation of the solution set of Linear System, to be held in the Computer Laboratory, using GeoGebra software.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Mathematical software problems"

1

Shorgin, Sergey Ya. Systems and means of informatics: Special issue : Mathematical and computer modeling in applied problems. Edited by Institut problem informatiki (Rossiĭskai︠a︡ akademii︠a︡ nauk). In-t of Informatics Problems, RAN, 2008.

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

service), SpringerLink (Online, ed. Algebraic Modeling Systems: Modeling and Solving Real World Optimization Problems. Springer Berlin Heidelberg, 2012.

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

Distributed coordination of multi-agent networks: Emergent problems, models, and issues. Springer-Verlag, 2011.

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

Igor, Potapov, and SpringerLink (Online service), eds. Reachability Problems: 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings. Springer-Verlag GmbH Berlin Heidelberg, 2011.

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

Zaslavski, Alexander J. Structure of Solutions of Variational Problems. Springer New York, 2013.

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

RP 2010 (2010 Brno, Czech Republic). Reachability problems: 4th international workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010 : proceedings. Springer, 2010.

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

Habib, Youssef, ed. Iterative computer algorithms with applications in engineering: Solving combinatorial optimization problems. IEEE Computer Society, 1999.

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

Quirk, Thomas J. Excel 2013 for biological and life sciences statistics: A guide to solving practical problems. Springer, 2015.

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

Igor, Potapov, and SpringerLink (Online service), eds. Reachability Problems: 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings. Springer Berlin Heidelberg, 2009.

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

Cheung, C. K. Multivariable calculus with Maple V: (preliminary edition). Wiley, 1994.

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

Book chapters on the topic "Mathematical software problems"

1

Kojima, Masakazu. "Exploiting Structured Sparsity in Large Scale Semidefinite Programming Problems." In Mathematical Software – ICMS 2010. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15582-6_2.

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

Liu, Y. Jane, and John Peddieson. "Application of Groebner Basis Methodology to Nonlinear Mechanics Problems." In Mathematical Software – ICMS 2014. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44199-2_61.

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

Mucherino, Antonio, Leo Liberti, and Carlile Lavor. "MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems." In Mathematical Software – ICMS 2010. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15582-6_34.

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

Shokin, Yu I. "New resource-sparing grid methods for solving the problems of mathematical physics." In Quality of Numerical Software. Springer US, 1997. http://dx.doi.org/10.1007/978-1-5041-2940-4_32.

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

Escher, Joachim, Anca-Voichita Matioc, and Bogdan-Vasile Matioc. "Analysis of a Mathematical Model Describing Necrotic Tumor Growth." In Modelling, Simulation and Software Concepts for Scientific-Technological Problems. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20490-6_10.

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

Dillmann, Roland. "Strategic Vehicle Routing in Practice — A pure Software Problem or a Problem Requiring Scientific Advice? Routing Problems of Daily Deliveries to the Same Customers." In Lecture Notes in Economics and Mathematical Systems. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-642-56183-2_17.

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

Krueger, Ryan, Jesse Michael Han, and Daniel Selsam. "Automatically Building Diagrams for Olympiad Geometry Problems." In Automated Deduction – CADE 28. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79876-5_33.

Full text
Abstract:
AbstractWe present a method for automatically building diagrams for olympiad-level geometry problems and implement our approach in a new open-source software tool, the Geometry Model Builder (GMB). Central to our method is a new domain-specific language, the Geometry Model-Building Language (GMBL), for specifying geometry problems along with additional metadata useful for building diagrams. A GMBL program specifies (1) how to parameterize geometric objects (or sets of geometric objects) and initialize these parameterized quantities, (2) which quantities to compute directly from other quantities, and (3) additional constraints to accumulate into a (differentiable) loss function. A GMBL program induces a (usually) tractable numerical optimization problem whose solutions correspond to diagrams of the original problem statement, and that we can solve reliably using gradient descent. Of the 39 geometry problems since 2000 appearing in the International Mathematical Olympiad, 36 can be expressed in our logic and our system can produce diagrams for 94% of them on average. To the best of our knowledge, our method is the first in automated geometry diagram construction to generate models for such complex problems.
APA, Harvard, Vancouver, ISO, and other styles
8

Dongarra, J. J., and D. C. Sorensen. "A Look at the Evolution of Mathematical Software for Dense Matrix Problems over the Past Fifteen Years." In The IMA Volumes in Mathematics and Its Applications. Springer US, 1988. http://dx.doi.org/10.1007/978-1-4684-6357-6_3.

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

Rice, John R., and Ronald F. Boisvert. "Software Parts for Elliptic Problems." In Springer Series in Computational Mathematics. Springer New York, 1985. http://dx.doi.org/10.1007/978-1-4612-5018-0_12.

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

Caravantes, Jorge, and Laureano Gonzalez-Vega. "On the Interference Problem for Ellipsoids: Experiments and Applications." In Mathematical Software – ICMS 2018. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96418-8_11.

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

Conference papers on the topic "Mathematical software problems"

1

Alberdi Celaya, Elisabete, Mª Isabel Eguia Ribero, Maria Josefa Gonzalez Gomez, and Judit Muñoz Matute. "GRAPHICAL RESOLUTION OF ENGINEERING PROBLEMS USING MATHEMATICAL SOFTWARE." In International Technology, Education and Development Conference. IATED, 2016. http://dx.doi.org/10.21125/iceri.2016.0513.

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

Andrey, Kostogryzov,. "Mathematical Models and Software Tools to Estimate Standard System Processes." In Information Control Problems in Manufacturing, edited by Bakhtadze, Natalia, chair Dolgui, Alexandre and Bakhtadze, Natalia. Elsevier, 2009. http://dx.doi.org/10.3182/20090603-3-ru-2001.00363.

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

SHANG, YI, MARKUS P. J. FROMHERZ, and LARA S. CRAWFORD. "EFFICIENT COOPERATIVE SOLVERS FOR NONLINEAR CONTINUOUS CONSTRAINT PROBLEMS." In Proceedings of the First International Congress of Mathematical Software. WORLD SCIENTIFIC, 2002. http://dx.doi.org/10.1142/9789812777171_0011.

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

Kitani, Noriko, and Shuichi Yukita. "Mathematical Ontology and a Software Tool for Semantic Retrieval of Exercise Problems." In 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008). IEEE, 2008. http://dx.doi.org/10.1109/waina.2008.217.

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

Veremchuk, Andriy, Andriy Pukas, Iryna Voytyuk, and Iryna Spivak. "Mathematical and software tools for modeling objects with distributed parameters." In 2016 13th International Conference on Modern Problems of Radio Engineering. Telecommunications and Computer Science (TCSET). IEEE, 2016. http://dx.doi.org/10.1109/tcset.2016.7451995.

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

Kostogryzov, Andrey. "Mathematical Models and Methods of System Engineering for Preventive Risks Control in Real Time." In 2019 Actual Problems of Systems and Software Engineering (APSSE). IEEE, 2019. http://dx.doi.org/10.1109/apsse47353.2019.00007.

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

HOFBAUER, DIETER, FRIEDRICH OTTO, CHRISTOPH KÖGL, and KLAUS E. MADLENER. "XSSR: AN EXPERIMENTAL SYSTEM FOR STRING REWRITING – DECISION PROBLEMS, ALGORITHMS, AND IMPLEMENTATION." In Proceedings of the First International Congress of Mathematical Software. WORLD SCIENTIFIC, 2002. http://dx.doi.org/10.1142/9789812777171_0013.

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

FLEGONTOV, A. V. "STRUCTURES OF THE POLYNOMIAL TYPES IN PROBLEMS OF THE INVARIANT ANALYSIS AND SYNTHESIS OF DIFFERENTIAL EQUATIONS." In Proceedings of the First International Congress of Mathematical Software. WORLD SCIENTIFIC, 2002. http://dx.doi.org/10.1142/9789812777171_0055.

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

O'Leary, Paul, Christoph Gugg, Matthew Harker, and Gerhard Rath. "Mathematical model and software architecture for the solution of inverse problems involving sensor arrays." In 2014 IEEE Sensors. IEEE, 2014. http://dx.doi.org/10.1109/icsens.2014.6985066.

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

Захарова, Алёна, Alena Zaharova, Дмитрий Коростелёв, Dmitry Korostelyov, Олег Федонин, and Oleg Fedonin. "Mathematical Support and Software of Visual Filtering of Alternatives in Multi-criteria Decision Making Problems." In 29th International Conference on Computer Graphics, Image Processing and Computer Vision, Visualization Systems and the Virtual Environment GraphiCon'2019. Bryansk State Technical University, 2019. http://dx.doi.org/10.30987/graphicon-2019-2-82-85.

Full text
Abstract:
The article deals with the problem of multi-criteria decision-making problems, which are characterized by a large number of options and alternatives. It is proposed to use visual filtering of graphic images describing the corresponding alternatives as one of the stages in decision-making in such tasks. The approaches and requirements for the construction of graphic images of alternatives are considered. Describes the steps and algorithms for constructing visual images of alternatives, based on the radial and pie charts, and include the normalization procedure. It describes software that implements the proposed algorithms, as well as providing interactive interaction with an expert for visual filtering of multi-criteria alternatives. Additionally, the capabilities of the developed software are described, which include filtering alternatives based on threshold values, as well as the possibility of conducting a series of experiments in order to obtain the union or intersection of filtered sets of alternatives. A synthetic test for filtering 201 alternatives is described, each of which is described by 15 criteria. As a result of a series of experiments, this choice set was reduced by about 28 times. A description is also given of an experiment on visual filtering of real alternatives that describe estimates of the accuracy of calculating inviscid flow around a cone using several OpenFoam solvers. Each solver is characterized by 288 criteria, and according to the results of visual filtering, the advantage in the accuracy of the calculations of two solvers over the others is clearly established.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Mathematical software problems"

1

Keller, H. B., and H. O. Kreiss. Mathematical Software for Hyperbolic Equations and Two Point Boundary Value Problems. Defense Technical Information Center, 1985. http://dx.doi.org/10.21236/ada151982.

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

Boisvert, Ronald F., Sally E. Howe, and David K. Kahaner. The guide to available mathematical software problem classification system. National Institute of Standards and Technology, 1990. http://dx.doi.org/10.6028/nist.ir.4475.

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

Keith, B., A. Apostolatos, A. Kodakkal, et al. D2.3. Adjoint-based error estimation routines. Scipedia, 2021. http://dx.doi.org/10.23967/exaqute.2021.2.022.

Full text
Abstract:
This document presents a simple and ecient strategy for adaptive mesh renement (AMR) and a posteriori error estimation for the transient incompressible Navier{Stokes equations. This strategy is informed by the work of Prudhomme and Oden [22, 23] as well as modern goal-oriented methods such as [5]. The methods described in this document have been implemented in the Kratos Multiphysics software and uploaded to https://zenodo.org [27].1 This document includes: A review of the state-of-the-art in solution-oriented and goal-oriented AMR. The description of a 2D benchmark model problem of immediate relevance to the objectives of the ExaQUte project. The denition and a brief mathematical summary of the error estimator(s). The results obtained. A description of the API.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Mathematical software 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