Tópicos Sugeridos dentro de su búsqueda.
Tópicos Sugeridos dentro de su búsqueda.
Buscar alternativas:
linear problema » linear problem (Expander búsqueda), linear problems (Expander búsqueda), lineales problema (Expander búsqueda)
para linear » para alinear (Expander búsqueda), para lineas (Expander búsqueda), para linea (Expander búsqueda)
linear problema » linear problem (Expander búsqueda), linear problems (Expander búsqueda), lineales problema (Expander búsqueda)
para linear » para alinear (Expander búsqueda), para lineas (Expander búsqueda), para linea (Expander búsqueda)
1
artículo
In this paper we consider the nonlinear transmission problem for the wave equation with time dependent coefficients and linear internal damping. We prove global existence and exponential decay of solution. The result is achieved by considering energy like - Lyapunov functionals and suitable unique continuation theorem for the wave equation.
2
artículo
In this paper we consider the nonlinear transmission problem for the wave equation with time dependent coefficients and linear internal damping. We prove global existence and exponential decay of solution. The result is achieved by considering energy like - Lyapunov functionals and suitable unique continuation theorem for the wave equation.
3
artículo
Publicado 2012
Enlace
Enlace
In the present’s paper studying a strategy for a typo of convex problem, we treat a linear programming problem whose coefficient of decision variables in the objective function has a nonlinear behavior. When the coefficients are constant the Simplex Method solves these problems without much difficulty, but when the coefficients are no longer constant and the Simplex does not work. We propose a technique that exploits the convex behavior of these coefficients and uses the theory of approximation by piecewise linear functions.
4
artículo
Publicado 2016
Enlace
Enlace
This article deals with the asymptotic behavior of nonoscillatory solutions of fourth order linear differential equation where the coefficients are perturbations of linear constant coefficient equation. We define a change of variable and deduce that the new variable satisfies a third order nonlinear differential equation. We assume three hypotheses. The first hypothesis is related to the constant coefficients and set up that the characteristic polynomial associated with the fourth order linear equation has simple and real roots. The other two hypotheses are related to the behavior of theperturbation functions and establish asymptotic integral smallness conditions of the perturbations. Under these general hypotheses, we obtain four main results. The first two results are related to the application of a fixed point argument to prove that the nonlinear third order equation has a unique solu...
5
artículo
Publicado 2016
Enlace
Enlace
This article deals with the asymptotic behavior of nonoscillatory solutions of fourth order linear differential equation where the coefficients are perturbations of linear constant coefficient equation. We define a change of variable and deduce that the new variable satisfies a third order nonlinear differential equation. We assume three hypotheses. The first hypothesis is related to the constant coefficients and set up that the characteristic polynomial associated with the fourth order linear equation has simple and real roots. The other two hypotheses are related to the behavior of theperturbation functions and establish asymptotic integral smallness conditions of the perturbations. Under these general hypotheses, we obtain four main results. The first two results are related to the application of a fixed point argument to prove that the nonlinear third order equation has a unique solu...
6
artículo
Publicado 2021
Enlace
Enlace
The generalized QR factorization, also known as GQR factorization, is a method that simultaneously transforms two matrices A and B in a triangular form. In this paper, we show the application of GQR factorization in solving linear equality-constrained least square problems; in addition, we explain how to use GQR factorization for solving quaternion least-square problems through the matrix representation of quaternions.
7
tesis doctoral
Publicado 2019
Enlace
Enlace
Descargue el texto completo en el repositorio institucional de la Universidade Federal de Minas Gerais: http://hdl.handle.net/1843/33570
8
artículo
Publicado 2019
Enlace
Enlace
The objective of this research study was to determine the relationship between the motivation of achievement and the resolution of problems with linear functions of the students of Foundations of Calculus for the afternoon course of the Faculty of Business at the Peruvian University of Applied Sciences, 2017. This study was developed within a quantitative approach, with a hypothetical deductive method and non-experimental design. The sample consisted of 76 students of Foundations of Calculus from the Faculty of Business of the aforementioned university. The results show that there is no direct and significant relationship between the motivation of achievement and the resolution of problems with linear functions of the students surveyed. This further showed that the competency to solve problems does not depend on motivation, but rather requires knowledge and skills that are put into pract...
9
artículo
Publicado 2019
Enlace
Enlace
The objective of this research study was to determine the relationship between the motivation of achievement and the resolution of problems with linear functions of the students of Foundations of Calculus for the afternoon course of the Faculty of Business at the Peruvian University of Applied Sciences, 2017. This study was developed within a quantitative approach, with a hypothetical deductive method and non-experimental design. The sample consisted of 76 students of Foundations of Calculus from the Faculty of Business of the aforementioned university. The results show that there is no direct and significant relationship between the motivation of achievement and the resolution of problems with linear functions of the students surveyed. This further showed that the competency to solve problems does not depend on motivation, but rather requires knowledge and skills that are put into pract...
10
artículo
Publicado 2019
Enlace
Enlace
The objective of this research study was to determine the relationship between the motivation of achievement and the resolution of problems with linear functions of the students of Foundations of Calculus for the afternoon course of the Faculty of Business at the Peruvian University of Applied Sciences, 2017. This study was developed within a quantitative approach, with a hypothetical deductive method and non-experimental design. The sample consisted of 76 students of Foundations of Calculus from the Faculty of Business of the aforementioned university. The results show that there is no direct and significant relationship between the motivation of achievement and the resolution of problems with linear functions of the students surveyed. This further showed that the competency to solve problems does not depend on motivation, but rather requires knowledge and skills that are put into pract...
11
artículo
Publicado 1999
Enlace
Enlace
A teoria geral de aproximação de problemas variacionais lineares desenvolvida por BABUSKA no início dos anos setenta, e refinada por DUPIRE, em sua tese defendida na PUC-Rio em 1985, é,juntamente com as estimativas clássicas do erro da interpolação polinomial em espacos de Sobolev, o ingrediente básico para a análise de convergencia de soluções aproximadas de equações diferenciais pelo Método dos Elementos Finitos. O objetivo deste trabalho é mostrar que ambas são também ferramentas apropriadas para as análises de erro e convergencia do Método dos Volumes Finitos. Mais especificamente,depois de recapitular os resultados de DUPIRE, no que tange à Aproximação abstrata dessa classe de problemas, damos um exemplo de estimativa de erro aplicada ao método dos volumes finitos, que ilustra tal asserção.
12
artículo
Publicado 1999
Enlace
Enlace
A teoria geral de aproximação de problemas variacionais lineares desenvolvida por BABUSKA no início dos anos setenta, e refinada por DUPIRE, em sua tese defendida na PUC-Rio em 1985, é,juntamente com as estimativas clássicas do erro da interpolação polinomial em espacos de Sobolev, o ingrediente básico para a análise de convergencia de soluções aproximadas de equações diferenciais pelo Método dos Elementos Finitos. O objetivo deste trabalho é mostrar que ambas são também ferramentas apropriadas para as análises de erro e convergencia do Método dos Volumes Finitos. Mais especificamente,depois de recapitular os resultados de DUPIRE, no que tange à Aproximação abstrata dessa classe de problemas, damos um exemplo de estimativa de erro aplicada ao método dos volumes finitos, que ilustra tal asserção.
13
artículo
Publicado 2018
Enlace
Enlace
El presente artículo tiene como objetivo proponer un criterio cuantitativo para evaluar la viabilidad de implementar soluciones basadas en programación lineal para resolver el problema de ruteo de vehículos (VRP). Se utilizó un diseño experimental para medir el tiempo relativo de solución con un modelo de programación lineal propuesto. La muestra utilizada fue aleatoria utilizando tres escenarios de dispersión de puntos de entrega: poco dispersos, dispersos y muy dispersos. Se utilizó un solver de programación lineal con el objetivo de determinar el tiempo y las iteraciones necesarias para encontrar la solución del modelo. Como resultado se encontró el tiempo de solución en función de la cantidad de puntos de entrega, la cantidad de iteraciones para los escenarios propuestos y se pronostica el tiempo necesario para resolver el problema utilizando el modelo propuesto. Se con...
14
artículo
Publicado 2022
Enlace
Enlace
This article presents an overview of the problem of identifying linear and nonlinear systems (Wiener type) operating in open loop. There are several algorithms that solve this problem, among them are the subspace methods (MOESP and N4SID). In order to evaluate the performance of the MOESP and N4SID methods, a simulated example is presented to compare the performance of these algorithms.
15
artículo
En el presente trabajo se estudia una estrategia para un tipo de problema convexo, Tratamos un problema de programación lineal cuyos coeficientes de las variables de decisión en la función objetivo tienen un comportamiento no lineal. Cuando los coeficientes son constantes el Método Simplex resuelve estos problemas sin mayor dificultad, pero cuando los coeficientes dejan de ser constantes ya el simplex no funciona, Se propone una técnica que explota el comportamiento convexo de dichos coeficientes y hace uso de la teoría de aproximación por funciones lineales a trozos.
16
artículo
Publicado 2018
Enlace
Enlace
Este reporte forma parte de una investigación más amplia y tiene como propósito reflexionar sobre la resolución de problemas de sistema de ecuaciones lineales con dos variables con la mediación de GeoGebra; además, el descubrimiento del manejo de la variación de parámetros, considerados en ambas ecuaciones, así como la función afín implícita, parámetros fijos y parámetros variables (variación de un coeficiente y variación de un término independiente). Se han considerado aspectos de la Teoría de Situaciones Didácticas y,para el diseño e implementación se han considerado el análisis a priori y a posterioride la Ingeniería Didáctica, así como loselementos de la Teoría de Registros de Representación Semiótica. Uno de los resultados obtenidos se refiere a que mediante un empleo adecuado del GeoGebra se podrá reconocer el efecto de modificar uno de los parámetros ...
17
tesis doctoral
Publicado 2018
Enlace
Enlace
Descargue el texto completo en el repositorio institucional de la Universidad Federal Fluminense: https://app.uff.br/riuff/handle/1/12750
18
tesis de maestría
Publicado 2013
Enlace
Enlace
Alguns problemas parabólicos podem ser reescritos na forma de problema de complementaridade e aparecem em muitas aplicações como em fluxos de líquidos no interior num domínio, difusão, fluxo de calor envolvendo mudança de fase e reações químicas. Estes tipos de problemas apresentam muitas dificuldades analíticas e numéricas, normalmente devido à evolução no tempo ou fronteira móvel. Como a solução analítica é muito difícil de obter, é importante o estudo de métodos numéricos que permitam a busca de uma solução aproximada da solução exata para tais tipos de problemas. Estuda-se leis de conservação e os tipos de soluções associadas ao Problema de Riemann, essencialmente leis de balanço que expressam o fato de que alguma substância é conservada. O estudo desta teoría é importante porque frequentemente as leis de conservação aparecem quando nos problema...
19
artículo
Publicado 2019
Enlace
Enlace
A network is an acyclic directed graph in which there are sources that have some messages and want to transmit to receivers through the combination of messages in intermediate nodes. The goal is to find a collection of functions that allow to combine messages in order to satisfy the demand of the receivers. In this paper, we study the fractional solvability problem of a network using an extension of the solvability problem in closure operators given by Gadouleau in 2013. We define linear programming problems via the desired extension in order to study capacities; using some information inequalities and characteristic-dependent linear rank inequalities, we obtain upper bounds on linear capacity of some networks and closure operators over some fields.
20
artículo
Publicado 2019
Enlace
Enlace
A network is an acyclic directed graph in which there are sources that have some messages and want to transmit to receivers through the combination of messages in intermediate nodes. The goal is to find a collection of functions that allow to combine messages in order to satisfy the demand of the receivers. In this paper, we study the fractional solvability problem of a network using an extension of the solvability problem in closure operators given by Gadouleau in 2013. We define linear programming problems via the desired extension in order to study capacities; using some information inequalities and characteristic-dependent linear rank inequalities, we obtain upper bounds on linear capacity of some networks and closure operators over some fields.
