Tópicos Sugeridos dentro de su búsqueda.
Tópicos Sugeridos dentro de su búsqueda.
Buscar alternativas:
para linear » para alinear (Expander búsqueda), para lineas (Expander búsqueda), para linea (Expander búsqueda)
problem » problema (Expander búsqueda), problemas (Expander búsqueda)
para linear » para alinear (Expander búsqueda), para lineas (Expander búsqueda), para linea (Expander búsqueda)
problem » problema (Expander búsqueda), problemas (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 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.
4
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.
5
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...
6
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...
7
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.
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 2018
Enlace
Enlace
We study the existence of weak solution for a non-linear problem with fractional p-Laplacian operator for the case where the order of the fractional derivative is 1/pp < alfa < 1, 1 < q < p-1, with 2 < p <Infinito, then using the minimization method called Nehari Manifold and its important relationship with the Fibering Maps, whichis defined in the form t-->J(tu), where J is the functional associated to the non-linear problem to be studied, the main result is obtained.
10
artículo
Publicado 2018
Enlace
Enlace
We study the existence of weak solution for a non-linear problem with fractional p-Laplacian operator for the case where the order of the fractional derivative is 1/pp < alfa < 1, 1 < q < p-1, with 2 < p <Infinito, then using the minimization method called Nehari Manifold and its important relationship with the Fibering Maps, whichis defined in the form t-->J(tu), where J is the functional associated to the non-linear problem to be studied, the main result is obtained.
11
artículo
Publicado 2018
Enlace
Enlace
This article aims to propose a quantitative criterion to evaluate the feasibility of implementing solutions based on linear programming for solving the vehicle routing problem (VRP). An experimental design was used to measure the relative solution time with a proposed linear programming model. The sample was randomized employing three dispersion scenarios of the delivery points: poorly scattered, scattered and very scattered. A linear programming solver was used to determine the time and iterations necessary for solving the model. As a result, the solution time was found in terms of the number of delivery points and the number of iterations for the proposed scenarios, and the time required to solve the problem was predicted using the proposed model. The research concludes with a proposal of the number of viable points to be solved by linear programming.
12
artículo
Publicado 2018
Enlace
Enlace
This article aims to propose a quantitative criterion to evaluate the feasibility of implementing solutions based on linear programming for solving the vehicle routing problem (VRP). An experimental design was used to measure the relative solution time with a proposed linear programming model. The sample was randomized employing three dispersion scenarios of the delivery points: poorly scattered, scattered and very scattered. A linear programming solver was used to determine the time and iterations necessary for solving the model. As a result, the solution time was found in terms of the number of delivery points and the number of iterations for the proposed scenarios, and the time required to solve the problem was predicted using the proposed model. The research concludes with a proposal of the number of viable points to be solved by linear programming.
13
artículo
Publicado 2015
Enlace
Enlace
This research work solves the problem of least squares that requires inner elipsoid algorithm to determine the descent direction; giving solution to linear programming problems by means of this methodof interior points. We solve the least squares problem using auxiliary function with logarithmic barrier and an approximation of the original matrix factorization by a matrix of rank one update to nally use the Sherman-Morrison-Woodburry formula and determining the inverse of the current matrix thus solving the least squares problem and obtaining a approximation to the descent direction.
14
artículo
Publicado 2015
Enlace
Enlace
This research work solves the problem of least squares that requires inner elipsoid algorithm to determine the descent direction; giving solution to linear programming problems by means of this methodof interior points. We solve the least squares problem using auxiliary function with logarithmic barrier and an approximation of the original matrix factorization by a matrix of rank one update to nally use the Sherman-Morrison-Woodburry formula and determining the inverse of the current matrix thus solving the least squares problem and obtaining a approximation to the descent direction.
15
artículo
Publicado 2021
Enlace
Enlace
In this article we will study the local well-posedness for a non-linear Cauchy problem associated with the differential equation KdV- Kuramoto-Sivashinsky: in the infinite dimensional spaces (periodic sobolev) H sper. We do this using the theory of C0- semigrupos, main properties of the Fourier transform in H sper, as the inmersions in these spaces and that H s-1per is a Banach algebra, which allows us to justify the presence of the non-linearity .
16
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.
17
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...
18
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...
19
artículo
Publicado 2024
Enlace
Enlace
Muchos investigadores hasta los años 2010, estudiaron el sistema de Timoshenko en diversas presentaciones sin retardo, desde el año 2010 hasta nuestros días se vienen trabajando los problemas con retardo; cabe así mencionar que, en el presente artículo abordamos el sistema de Timoshenko con dos disipaciones internas parciales, que se aplican al desplazamiento transversal y al movimiento rotacional de la viga unidimensional, con retraso en el tiempo en ambas ecuaciones. Nos enfocamos hacer ver que, el problema está bien puesto, es decir, existe y es única la solución del sistema planteado, con sus condiciones iniciales y de frontera del tipo Dirichlet. Para ello usaremos la teoría de semigrupos lineales y la energía asociada al sistema.
20
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...
