![LibRes:slides](https://writelatex.s3.amazonaws.com/published_ver/1916.jpeg?X-Amz-Expires=14400&X-Amz-Date=20240630T152745Z&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIAWJBOALPNFPV7PVH5/20240630/us-east-1/s3/aws4_request&X-Amz-SignedHeaders=host&X-Amz-Signature=68bf59c6ec0482e04705edfa2468555e37ab49c6669e313f5ddc9b21f26f6fa9)
LibRes:slides
Author
Luis Diego Soto Ugalde
Last Updated
9 лет назад
License
Creative Commons CC BY 4.0
Abstract
slide template DAS eie0217 UCR
![LibRes:slides](https://writelatex.s3.amazonaws.com/published_ver/1916.jpeg?X-Amz-Expires=14400&X-Amz-Date=20240630T152745Z&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=AKIAWJBOALPNFPV7PVH5/20240630/us-east-1/s3/aws4_request&X-Amz-SignedHeaders=host&X-Amz-Signature=68bf59c6ec0482e04705edfa2468555e37ab49c6669e313f5ddc9b21f26f6fa9)
\documentclass{beamer} %
\usetheme{Dresden}
\usecolortheme{beaver}
\usepackage[spanish]{babel}
\usepackage[utf8x]{inputenc}
\usefonttheme{professionalfonts}
\usepackage{times}
\usepackage{tikz}
\usepackage{amsmath}
\usepackage{tabulary}
\usepackage{pgfgantt}
\usepackage{verbatim}
\usetikzlibrary{arrows,shapes}
\usepackage{adjustbox}
\usepackage{soul}
\usepackage{listings}
\usepackage{adjustbox}
\setbeamertemplate{itemize item}{\color{red}$\blacksquare$}
\usepackage{hyperref}
\title{avance1}
\title[Alg-Lin]{Alg-Lin:Librer\'ia de \'Algebra Lineal}
\institute[]{Enterprise}
\author[A91329, B26613, A86605]{Ronald Caravaca, L.Diego Soto , C\'esar Valverde}
\date{\today}
\begin{document}
\tikzstyle{every picture}+=[remember picture]
\lstset{language=C++}
\everymath{\displaystyle}
\begin{frame}
\titlepage
\end{frame}
%------------------------------------------------------
\begin{frame}{C++}
\begin{columns}
\column{0.6\textwidth}
hola
\column{0.4\textwidth}
\begin{itemize}
\item Lo estamos aprendiendo en el curso
\item Programaci\'on orientada a objetos
\end{itemize}
\end{columns}
\end{frame}
\begin{frame}[fragile]{Descomposición LU}
\begin{adjustbox}{width=0.55\textwidth,keepaspectratio}
\begin{lstlisting}
for(int i = 0; x < fila; i++)
{
buscar el numero mas grande
}
for(int k = 0; x < fila; i++){
for(int i = k; x < fila; i++){
multiplica cada fila por su escalamiento
}
if (){Se evalua si hay que cambiar las filas}
for(int i = k+1; x < fila; i++){
Se multiplica cada fila por el pivote
}
}
\end{lstlisting}
\end{adjustbox}
\end{frame}
\end{document}